Note on the behaviour of an improvement heuristic on permutation and blocking flow-shop scheduling
暂无分享,去创建一个
[1] S.M.A. Suliman,et al. A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .
[2] C. V. Ramamoorthy,et al. On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .
[3] Jaideep Motwani,et al. Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994 , 1997 .
[4] R E Gomory,et al. A SOLVABLE CASE OF THE TRAVELING SALESMAN PROBLEM. , 1964, Proceedings of the National Academy of Sciences of the United States of America.
[5] Christos H. Papadimitriou,et al. Flowshop scheduling with limited temporary storage , 1980, JACM.
[6] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[7] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[8] G. B. McMahon,et al. Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..
[9] Jatinder N. D. Gupta,et al. A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .
[10] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[11] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[12] E. Lawler,et al. Well-solved special cases , 1985 .
[13] Jung Woo Jung,et al. Flowshop-scheduling problems with makespan criterion: a review , 2005 .
[14] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[15] Manuel Mateo,et al. Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|block|Cmax problems , 2007, Comput. Oper. Res..
[16] Z. A. Lomnicki,et al. Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .
[17] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[18] D. S. Palmer. Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .
[19] Marcelo Seido Nagano,et al. A high quality solution constructive heuristic for flow shop sequencing , 2002, J. Oper. Res. Soc..
[20] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[21] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[22] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .
[23] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[24] Hamid Davoud Pour. A new heuristic for the n-job, m-machine flow-shop problem , 2001 .