Minimizing Maximum Lateness on Unbounded Single Batching Machine with Family Jobs

• 作 者: 郑睿 李宏余
• 机 构: PudongAcademyofReformandDevelopment,SchoolofManagement
• 出 处: 东华大学学报：英文版
• 发表日期: 2010年5期
• 基金项目: National Natural Science Foundation of China（No.70832002）, Graduate Student Innovation Fund of Fudan University China

The scheduling problem on a single batching machine with family jobs was proposed.The single batching machine can process a group of jobs simultaneously as a batch.Jobs in the same batch complete at the same time.The batch size is assumed to be unbounded.