Load Information Based Priority Dependant Heuristic for Manpower Scheduling Problem in Remanufacturing
暂无分享,去创建一个
[1] Janny Leung,et al. Solving a manpower scheduling problem for airline catering using metaheuristics , 2010, Eur. J. Oper. Res..
[2] Shengyao Wang,et al. An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .
[3] Michael A. Bender,et al. An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 2001, J. Algorithms.
[4] Thomas Lechler,et al. Gantt charts revisited: A critical analysis of its roots and implications to the management of projects today , 2012 .
[5] H. C. Lau. On the complexity of manpower shift scheduling , 1996 .
[6] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[7] Quan-Ke Pan,et al. Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stage heuristic algorithm , 2010 .
[8] F. Pezzella,et al. A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..
[9] P. N. Suganthan,et al. Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.