Flowshop scheduling research after five decades
Tóm tắt
Từ khóa
Tài liệu tham khảo
Aarts, 1997
Allahverdi, 1999, A survey of scheduling research involving setup considerations, OMEGA, International Journal of Management Science, 27, 219, 10.1016/S0305-0483(98)00042-5
Ashour, 1972
Bellman, 1956, Mathematical aspects of scheduling theory, Journal of Society of Industrial and Applied Mathematics, 4, 168, 10.1137/0104010
Bellman, 1954, Some combinatorial problems arising in the theory of multi-stage processes, Journal of Society of Industrial and Applied Mathematics, 2, 175, 10.1137/0102012
Bellman, 1982
Brown, 1966, Some applications of the branch and bound algorithm to the machine scheduling problem, Operational Research Quarterly, 17, 173, 10.1057/jors.1966.25
1995
Brucker, 1998
Byrd, 1983
Chen, 1998, A review of machine scheduling: Complexity, algorithms and applications, 21
Cheng, 2000, A review of flowshop scheduling research with setup times, Production and Operations Management, 9, 283, 10.1111/j.1937-5956.2000.tb00137.x
Conway, 1967
Corwin, B.D., 1969. Some flow shop scheduling problems involving sequence dependent setup times, Technical Memoramdum #150. Case Western Reserve University, Cleveland, OH.
Corwin, 1974, Two-machine flowshop scheduling problems with sequence dependent setup times: A dynamic programming approach, Naval Research Logistics Quarterly, 21, 515, 10.1002/nav.3800210311
1982
Dudek, 1964, Development of m-stage decision rule for scheduling n jobs through m machines, Operations Research, 12, 471, 10.1287/opre.12.3.471
Framinan, 2004, A review and classification of heuristics for permutation flow-shop scheduling with makespan objective, Journal of the Operational Research Society, 55, 1243, 10.1057/palgrave.jors.2601784
Garey, 1979
Geismar, 2004, Robotic cells with parallel machines: Throughput maximization in constant travel-time cells, Journal of Scheduling, 7, 375, 10.1023/B:JOSH.0000036861.28456.5d
Gupta, J.N.D., 1969a. Economic Aspects of Scheduling Theory PhD Dissertation, Texas Tech University, Lubbock, TX.
Gupta, 1969, A general algorithm for the n×m flowshop scheduling problem, The International Journal of Production Research, 7, 241, 10.1080/00207546808929814
Gupta, 1970, M-stage flowshop by branch and bound, Opsearch, 9, 37
Gupta, 1971, An improved combinatorial algorithm for the flowshop scheduling problem, Operations Research, 19, 1753, 10.1287/opre.19.7.1753
Gupta, 1972, Optimal scheduling in a multi-stage flowshop, AIIE Transactions, 4, 238, 10.1080/05695557208974856
Gupta, 1975, A search algorithm for the generalized flowshop scheduling problem, Computers and Operations Research, 2, 83, 10.1016/0305-0548(75)90011-8
Gupta, 1979, A review of flowshop scheduling research, 363
Gupta, 2000, Selecting a scheduling heuristic through neural networks, INFORMS Journal of Computing, 12, 150, 10.1287/ijoc.12.2.150.11893
Heller, J., 1959. Combinatorial, probabilistic, and statistical aspects of an M×J scheduling problem. AEC Research and Development Report NYO-2540, New York University.
Heller, 1960, Some numerical experiments for an M×J flowshop and its decision-theoretical aspects, Operations Research, 8, 178, 10.1287/opre.8.2.178
Ignall, 1965, Application of branch-and-bound technique to some flow shop problems, Operations Research, 13, 400, 10.1287/opre.13.3.400
Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research logistics Quarterly, 1, 61, 10.1002/nav.3800010110
Lawler, 1993, Sequencing and scheduling: Algorithms and complexity, Vol. 4, 445
Lageweg, 1978, A general bounding scheme for the permutation flow-shop problem, Operations Research, 26, 53, 10.1287/opre.26.1.53
Lomnicki, 1965, A branch and bound algorithm for the exact solution of the three machine scheduling problem, Operational Research Quarterly, 16, 89, 10.1057/jors.1965.7
McMahon, 1969, Optimal production schedules for flowshops, Canadian Operational Research Society Journal, 7, 141
McMahon, 1967, Flowshop scheduling with the branch and bound method, Operations Research, 15, 473, 10.1287/opre.15.3.473
Morton, 1993
1963
Osman, 1996
Pinedo, 1995
Potts, 1992, Integrating scheduling with batching and lot sizing: A review of algorithms and complexity, Journal of the Operational Research Society, 43, 395, 10.1057/jors.1992.66
Potts, 2000, Scheduling with batching: A review, European Journal of Operational Research, 120, 228, 10.1016/S0377-2217(99)00153-8
Rayward-Smith, 1996
Ruiz, 2005, Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, European Journal of Operational Research, 165, 34, 10.1016/j.ejor.2004.01.022
Sisson, 1959, Methods of sequencing in job shops—a review, Operations Research, 7, 10, 10.1287/opre.7.1.10
Smith, R.D., Dudek, R.A., 1967. A General algorithm for the solution of the n job, m machine sequencing problem of the flowshop. Operations Research 15, 71–82. Also, see their Errata Operations Research 17, 756.
Smutnicki, 1998, Some results of the worst-case analysis for flow shop scheduling, European Journal of Operational Research, 109, 66, 10.1016/S0377-2217(97)00139-2
Szwarc, 1971, Elimination methods in the m×n sequencing problem, Naval Research Logistics Quarterly, 295, 10.1002/nav.3800180302
Szwarc, 1973, Optimal elimination methods in the m×n flowshop scheduling problem, Operations Research, 21, 1250, 10.1287/opre.21.6.1250
Tanaev, 1994
T’Kindt, 2002
Trietsch, 1993, Basic techniques of lotstreaming, Operations Research, 41, 1065, 10.1287/opre.41.6.1065
Tseng, 2004, An empirical analysis of the integer programming formulations for the permutation flowshop, OMEGA: The International Journal of Management Science, 32, 285, 10.1016/j.omega.2003.12.001
Uskup, 1975, A branch and bound for two-stage production sequencing, Operations Research, 23, 118, 10.1287/opre.23.1.118
Wagner, 1959, An integer linear-programming model for machine scheduling, Naval Research Logistics Quarterly, 6, 131, 10.1002/nav.3800060205
Zweben, 1994