Heuristics for single machine scheduling problem with family setup times
暂无分享,去创建一个
[1] Jeffrey E. Schaller. SCHEDULING ON A SINGLE MACHINE WITH FAMILY SETUPS TO MINIMIZE TOTAL TARDINESS , 2007 .
[2] Jatinder N. D. Gupta,et al. Single machine scheduling with family setups to minimize total earliness and tardiness , 2008, Eur. J. Oper. Res..
[3] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[4] Francis Sourd,et al. Earliness-tardiness scheduling with setup considerations , 2005, Comput. Oper. Res..
[5] Christos Koulamas,et al. The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..
[6] C. Chu. A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .
[7] Wlodzimierz Szwarc,et al. Algorithmic paradoxes of the single‐machine total tardiness problem , 2001 .
[8] L Zou. Single Machine Scheduling with Job Class Setups Based on Improved Genetic Algorithm , 2010 .
[9] Jatinder N. D. Gupta,et al. Single machine group scheduling with family setups to minimize total tardiness , 2008 .
[10] Liu Zheng-gang. Single machine scheduling problem with family setup times , 2009 .