Mixed Neighbourhood Local Search for Customer Order Scheduling Problem
暂无分享,去创建一个
[1] Chang Sup Sung,et al. Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines , 1998 .
[2] Ik Sun Lee,et al. Minimizing total tardiness for the order scheduling problem , 2013 .
[3] Uttarayan Bagchi,et al. Coordinated scheduling of customer orders for quick response , 2005 .
[4] El-Ghazali Talbi,et al. Metaheuristics - From Design to Implementation , 2009 .
[5] Joseph Y.-T. Leung,et al. Order Scheduling in an Environment with Dedicated Resources in Parallel , 2005, J. Sched..
[6] Q. Wang,et al. Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .
[7] Joseph Y.-T. Leung,et al. Order Scheduling Models: An Overview , 2005 .
[8] Jose M. Framiñan,et al. New approximate algorithms for the customer order scheduling problem with total completion time objective , 2017, Comput. Oper. Res..
[9] Jaehwan Yang. Scheduling with batch objectives , 1998 .