Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags
暂无分享,去创建一个
[1] Masahiro Inuiguchi,et al. Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness , 2010, Comput. Oper. Res..
[2] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[3] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[4] Tatsushi Nishi,et al. Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness , 2013 .
[5] Philip M. Kaminsky,et al. Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs , 2004 .
[6] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[7] Peter B. Luh,et al. Scheduling products with bills of materials using an improved Lagrangian relaxation technique , 1994, IEEE Trans. Robotics Autom..
[8] Olfat Laya,et al. A Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems , 2010 .
[9] Peter B. Luh,et al. Scheduling permutation flow shops using the Lagrangian relaxation technique , 1996, Ann. Oper. Res..
[10] Mauro Dell'Amico,et al. Shop Problems With Two Machines and Time Lags , 1996, Oper. Res..
[11] Ammar Oulamara,et al. Permutation flowshop scheduling problems with maximal and minimal time lags , 2006, Comput. Oper. Res..
[12] Han Hoogeveen,et al. Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard , 2004, J. Sched..
[13] Christos Koulamas,et al. The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..
[14] Chengbin Chu,et al. Single Machine Scheduling with Chain Structured Precedence Constraints and Separation Time Windows , 2004 .
[15] L. R. Foulds,et al. Scheduling operations for the harvesting of renewable resources , 2005 .