The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times
暂无分享,去创建一个
T. C. Edwin Cheng | C. T. Ng | Fawaz S. Al-Anzi | Ali Allahverdi | C. T. Ng | T. Cheng | A. Allahverdi | C. Ng
[1] C. Chu. A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .
[2] Katsundo Hitomi,et al. Optimal Two-Stage Production Scheduling with Setup Times Separated , 1979 .
[3] S. C. Kim,et al. Impact of sequence-dependent setup time on job shop scheduling performance , 1994 .
[4] Yeong-Dae Kim,et al. A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..
[5] Rubén Ruiz,et al. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.
[6] Ali Allahverdi,et al. Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns , 1995 .
[7] Bertrand M. T. Lin,et al. Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs , 2004 .
[8] Jonathan F. Bard,et al. Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups , 1998, Comput. Oper. Res..
[9] Ramez Elmasri,et al. Fundamentals of Database Systems , 1989 .
[10] G. Rinaldi,et al. Scheduling tasks with sequence-dependent processing times , 1988 .
[11] Hung-Liang Cheng,et al. A heuristic approach for single-machine scheduling with due dates and class setups , 2001, Comput. Oper. Res..
[12] Fawaz S. Al-Anzi,et al. Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications , 2002, Comput. Oper. Res..
[13] Fawaz S. Al-Anzi,et al. A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times , 2006, Eur. J. Oper. Res..
[14] Gabriel R. Bitran,et al. Sequencing production on parallel machines with two magnitudes of sequence dependent setup costs , 1989 .
[15] Amir Azaron,et al. Solving a dynamic cell formation problem using metaheuristics , 2005, Appl. Math. Comput..
[16] T. C. Edwin Cheng,et al. Single machine batch scheduling with resource dependent setup and processing times , 2001, Eur. J. Oper. Res..
[17] Reha Uzsoy,et al. Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine , 1992 .
[18] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[19] Tapan Sen,et al. Job lateness in a two-machine flowshop with setup times separated , 1991, Comput. Oper. Res..
[20] Jatinder N. D. Gupta,et al. A review of scheduling research involving setup considerations , 1999 .
[21] Ali Allahverdi,et al. Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times , 2000, Comput. Oper. Res..
[22] Yeong-Dae Kim. Minimizing total tardiness in permutation flowshops , 1995 .
[23] Jonathan F. Bard,et al. An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times , 1999, J. Heuristics.
[24] A. Volgenant,et al. Improved heuristics for the n-job single-machine weighted tardiness problem , 1999, Comput. Oper. Res..