Multiprocessor Flow Shop Scheduling Problem with Common due Window
暂无分享,去创建一个
[1] Chinyao Low,et al. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..
[2] H. Nagasawa,et al. Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties , 1993 .
[3] Li-Ning Xing,et al. An Improved Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2009, 2009 International Joint Conference on Computational Sciences and Optimization.
[4] Ebbe G. Negenman,et al. Local search algorithms for the multiprocessor flow shop scheduling problem , 2001, Eur. J. Oper. Res..
[5] Shih-Wei Lin,et al. Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach , 2006 .
[6] Funda Sivrikaya-Serifoglu,et al. Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..
[7] H Rong Hwa,et al. ANT COLONY SYSTEM FOR JOB SHOP SCHEDULING WITH TIME WINDOWS , 2008 .
[8] Zhi-Long Chen,et al. Parallel machine scheduling with a common due window , 2002, Eur. J. Oper. Res..
[9] Ceyda Oguz,et al. Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..