Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times

详细信息    查看全文

• 作者：José ; Elias C. Arroyo^a ; ^{jarroyo@dpi.ufv.br} ; Joseph Y.-T. Leung^b ; ^c ; ^{leung@njit.edu}
• 关键词：Scheduling ; Unrelated parallel batch machines ; NP-hard ; Makespan ; Heuristics
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：117-128
• 全文大小：2099 K
• 卷排序：78

文摘

Scheduling unrelated batch processing machines with non-identical job sizes and unequal release times. The objective is to minimize makespan. Deterministic heuristics are proposed. According to computational experiments, one of the heuristics outperformed the others.