A review of scheduling research involving setup considerations
Tóm tắt
Từ khóa
Tài liệu tham khảo
Ostwald PF. Cost estimating. Salvendy G, editor. Handbook of Industrial Engineering, 2nd ed. 1992, p. 1263–1288
Wilbrecht, 1969, The influence of setup time on job shop performance, Manage Sci, 16, B274, 10.1287/mnsc.16.4.B274
Panwalkar SS, Dudek RA, Smith ML. Sequencing research and the industrial scheduling problem. Elmaghraby SE, editor. Symposium on the Theory of Scheduling and its Applications. 1973, pp. 29–38
Flynn, 1987, The effects of setup time on output capacity in cellular manufacturing, Int J Prod Res, 25, 1761
Wortman, 1992, Managing capacity: getting the most from your firm's assets, Ind Eng, 24, 47
Krajewski, 1987, Kanban, MRP, and shaping the manufacturing environment, Manage Sci, 33, 39, 10.1287/mnsc.33.1.39
Yang, 1993, Setup reduction and competitive advantage in a closed manufacturing cell, Eur J Oper Res, 69, 413, 10.1016/0377-2217(93)90025-I
Patterson, 1993, Analysis of setup time at constraint resources, Int J Prod Res, 31, 845, 10.1080/00207549308956761
Logendran, 1993, Two-machine group scheduling problem with blocking and anticipatory setups, Eur J Oper Res, 69, 467, 10.1016/0377-2217(93)90029-M
Unal, 1997, Rescheduling on a single machine with part-type dependent setup times and deadlines, An Oper Res, 70, 93, 10.1023/A:1018955111939
Baker KR. Heuristic procedures for scheduling job families with setups and due dates. Working Paper No. 312, The Amos Tuck School of Business Administration, Hanover, NH 03755: Dartmouth College, 1997
Bruno, 1978, Complexity of task sequencing with deadlines, set-up times and changeover costs, SIAM J Comput, 7, 393, 10.1137/0207031
Monma, 1989, On the complexity of scheduling with batch setups, Oper Res, 37, 798, 10.1287/opre.37.5.798
Chen, 1993, A better heuristic for preemptive parallel machine scheduling with batch setup times, SIAM J Comput, 22, 1303, 10.1137/0222078
Pinedo M. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, NJ, 1995
Conway RW, Maxwell WL, Miller LW. Theory of Scheduling, Addison Wesley, MA, 1967
Das, 1995, A saving index heuristic algorithm for flowshop scheduling with sequence dependent set-up times, J Oper Res Soc, 46, 1365, 10.1057/jors.1995.184
Franca, 1996, A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times, Int J Prod Econ, 43, 79, 10.1016/0925-5273(96)00031-X
Srikar, 1986, A MILP model for the n-job, M-stage flowshop, with sequence dependent setup times, Int J Prod Res, 24, 1459, 10.1080/00207548608919815
Bianco, 1988, Scheduling tasks with sequence-dependent processing times, Naval Res Logist, 35, 177, 10.1002/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-V
Bitran, 1990, Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost, J Manufact Oper Manage, 3, 24
Kim, 1994, Impact of sequence-dependent setup times on job shop scheduling performance, Int J Prod Res, 32, 1503, 10.1080/00207549408957019
Ovacik, 1992, Shifting bottleneck algorithm for scheduling semiconductor testing operations, J Electron Manufact, 2, 119, 10.1142/S0960313192000157
Sule, 1983, Sequency on two and three machines with setup, processing and removal times separated, Int J Prod Res, 21, 723, 10.1080/00207548308942406
Bahl, 1987, Determining lot sizes and resource requirements: a review, Oper Res, 35, 329, 10.1287/opre.35.3.329
Missbauer, 1997, Order release and sequence dependent setup times, Int J Prod Econ, 49, 131, 10.1016/S0925-5273(97)00008-X
Potts, 1992, Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity, J Oper Res Soc, 43, 395, 10.1057/jors.1992.66
Vickson, 1992, Two and three-machine flowshop scheduling problems with equal size transfer batches, Int J Prod Res, 30, 1551, 10.1080/00207549208948107
Cetinkaya, 1992, Unit-sized transfer batch scheduling with setup times, Comput Ind Eng, 22, 177, 10.1016/0360-8352(92)90045-L
Cetinkaya, 1994, Lot streaming in a 2-stage flowshop with setup, processing, and removal times separated, J Oper Res Soc, 45, 1445, 10.1057/jors.1994.221
Glass, 1994, Lot streaming in 3-stage production processes, Eur J Oper Res, 75, 378, 10.1016/0377-2217(94)90082-5
Vickson, 1995, Optimal lot streaming for multiple products in a two-machine flowshop, Eur J Oper Res, 85, 556, 10.1016/0377-2217(93)E0366-6
Chen, 1997, Lot streaming with detached setups in 3-machine flowshops, Eur J Oper Res, 96, 591, 10.1016/S0377-2217(96)00091-4
Sen, 1984, A state-of-art survey of static scheduling research involving due dates, OMEGA Int J Manage Sci, 12, 63, 10.1016/0305-0483(84)90011-2
Cheng TCE, Gupta MC. Survey of scheduling research involving due date determination decisions, 1989;38:156–166
Gupta, 1987, Single-machine scheduling research, OMEGA Int J Manage Sci, 15, 207, 10.1016/0305-0483(87)90071-5
Tang, 1990, Scheduling batches on parallel machines with major and minor set-ups, Eur J Oper Res, 46, 28, 10.1016/0377-2217(90)90295-M
Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In Logistics of Production and Inventory. Graves SC, Rinnooy Kan AHG, Zipkin PH, editors. Amsterdam, Netherlands: North Holland, 1993, p. 445–522
Glassey, 1968, Minimum changeover scheduling of several products on one machine, Oper Res, 16, 342, 10.1287/opre.16.2.342
Mitsumori, 1972, Optimal production scheduling of multi-commodity in flow line, IEEE Trans Syst Man Cybern, 2, 486, 10.1109/TSMC.1972.4309158
Miyazaki S, Ohta H. Backward scheduling to minimize the actual mean flow time with dependent and independent setup times. Proc. IXth ICPR, 1987, p. 2680–2686
Zdrzalka, 1994, Preemptive scheduling with release dates, delivery times and sequence independent setup times, Eur J Oper Res, 76, 60, 10.1016/0377-2217(94)90006-X
Laporte, 1992, The traveling salesman problem: An overview of exact and approximate algorithms, Eur J Oper Res, 59, 231, 10.1016/0377-2217(92)90138-Y
Junger M, Reinelt G, Rinaldi G. The traveling salesman problem. in Annotated bibliographies in combinatorial optimization. Dell'Amico M, Maffioli F, Marcello S, editors. Wiley, 1997
Gilmore, 1964, Sequencing a one-state variable machine; a solvable case of the traveling salesman problem, Oper Res, 12, 655, 10.1287/opre.12.5.655
Presby, 1967, An algorithm for solving job sequencing problems, Manage Sci, 13, B454, 10.1287/mnsc.13.8.B454
Driscoll, 1977, Scheduling production on one machine with changeover costs, AIIE Trans, 9, 388, 10.1080/05695557708975171
Burstall, 1966, A heuristic method for a job-shop scheduling problem, Oper Res Q, 17, 291, 10.1057/jors.1966.56
Buzacott, 1971, Sequencing many jobs on a multi-purpose facility, Naval Res Logist Q, 18, 75, 10.1002/nav.3800180106
Taha, 1971, Sequencing by implicit ranking and zero-one polynomial programming, AIIE Trans, 3, 299, 10.1080/05695557108974819
Sielken, 1976, Sequencing with set-up costs by zero-one mixed integer linear programming, AIIE Trans, 8, 369, 10.1080/05695557608975093
Barnes, 1981, Scheduling jobs with linear delay penalties and sequence dependent setup costs, Oper Res, 29, 146, 10.1287/opre.29.1.146
Kusiak, 1987, Modeling and solving the flexible forging module scheduling problem, Eng Optim, 12, 1, 10.1080/03052158708941080
Laguna, 1991, Tabu search methods for a single-machine scheduling problem, J Intell Manufact, 2, 63, 10.1007/BF01471219
Laguna, 1993, Integrating target analysis and tabu search for improved scheduling systems, Exp Sys Appl, 6, 287, 10.1016/0957-4174(93)90056-C
Feo, 1996, A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties, Comput Oper Res, 23, 881, 10.1016/0305-0548(95)00084-4
Kolahan, 1995, Solving the combined part sequencing and tool replacement problem for an automated machine center: A Tabu search approach, Comput Ind Eng, 28, 731, 10.1016/0360-8352(95)00018-V
Gavett, 1965, Three heuristic rules for sequencing jobs to a single production facility, Manage Sci, 11, B166, 10.1287/mnsc.11.8.B166
Haynes, 1973, The effectiveness of three heuristic rules for job sequencing in a single production facility, Manage Sci, 9, 575, 10.1287/mnsc.19.5.575
White, 1977, Sequence dependent setup times and job sequencing, Int J Prod Res, 15, 191, 10.1080/00207547708943117
Woodruff, 1992, Sequencing and batching for two classes of job with deadlines and setup times, Prod Oper Manage, 1, 87, 10.1111/j.1937-5956.1992.tb00341.x
Farn, 1979, The dynamic aspects of a production scheduling problem, Int J Prod Res, 17, 15, 10.1080/00207547908919591
Lockett, 1972, A scheduling problem involving sequence dependent changeover costs, Oper Res, 20, 895, 10.1287/opre.20.4.895
Moore, 1975, An algorithm for a single-machine scheduling problem with sequence-dependent setup times and scheduling windows, AIIE Trans, 7, 35, 10.1080/05695557508974982
Picard, 1978, The time-dependent traveling salesman problem and its application to the tardiness problem in one machine scheduling, Oper Res, 26, 86, 10.1287/opre.26.1.86
Uzsoy, 1991, Production scheduling algorithms for a semiconductor test facility, IEEE Trans Semicond Manufact, 4, 270, 10.1109/66.97809
Uzsoy, 1992, Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine, Naval Res Logist, 39, 369, 10.1002/1520-6750(199204)39:3<369::AID-NAV3220390307>3.0.CO;2-F
Ovacik, 1994, Exploiting shop floor status information to schedule complex job shops, J Manufact Syst, 13, 73, 10.1016/0278-6125(94)90023-X
Ovacik, 1994, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, Int J Prod Res, 32, 1243, 10.1080/00207549408956998
Rubin, 1995, Scheduling in a sequence dependent setup environment with genetic search, Comput Oper Res, 22, 85, 10.1016/0305-0548(93)E0021-K
Kim, 1995, A hybrid approach to sequencing jobs using heuristic rules and neural networks, Prod Planning Control, 6, 445, 10.1080/09537289508930302
Lee, 1997, A heuristic to minimize the total weighted tardiness with sequence dependent setups, IIE Trans, 29, 45, 10.1080/07408179708966311
Raman, 1989, Real-time scheduling on an automated machine center, Eur J Oper Res, 40, 222, 10.1016/0377-2217(89)90332-9
Asano, 1996, Single machine scheduling using dominance relation to minimize earliness subject to ready and due times, Int J Prod Econ, 44, 35, 10.1016/0925-5273(95)00090-9
ten Kate HA, Wijngaard J, Zijm WHM. Minimizing total earliness, tardiness, and setup costs. Research Report No. RR 1991-12, School of Management and Organization, University of Groningen, Holland, 1991
Tan, 1997, Multi-objective sequencing with sequence dependent setup times, Int J Oper Quant Manage, 3, 69
Bruno, 1978, Tasks sequencing in a batch environment with setup times, Found Control Eng, 3, 105
Mason, 1991, Minimizing flow time on a single machine with job classes and setup times, Naval Res Logist, 38, 333, 10.1002/1520-6750(199106)38:3<333::AID-NAV3220380305>3.0.CO;2-0
Herrmann, 1995, Solving a class scheduling problem with a genetic algorithm, ORSA J Comput, 7, 443, 10.1287/ijoc.7.4.443
Mason AJ. Genetic algorithms and scheduling problems. PhD thesis, Department of Management Sciences, University of Cambridge, UK, 1992
Webster, 1995, Scheduling groups of jobs on a single machine, Oper Res, 43, 692, 10.1287/opre.43.4.692
Ozden, 1985, Job scheduling in a group technology environment for a single facility, Comput Ind Eng, 9, 67, 10.1016/0360-8352(85)90037-3
Liao, 1997, Single machine scheduling with major and minor setups, Comp Oper Res, 24, 169, 10.1016/S0305-0548(96)00051-2
Gupta, 1997, Single machine hierarchical scheduling with customer orders and multiple job classes, An Oper Res, 70, 127, 10.1023/A:1018913902852
Liao, 1993, Tradeoffs between setup times and carrying costs for finished items, Comp Oper Res, 20, 697, 10.1016/0305-0548(93)90057-P
Zdrzalka, 1991, Approximation algorithm for single-machine sequencing with delivery times and unit batch set-up times, Eur J Oper Res, 51, 199, 10.1016/0377-2217(91)90250-Y
Zdrzalka, 1995, Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times, J Oper Res Soc, 80, 371, 10.1016/0377-2217(93)E0160-Y
Baker KR, Magazine MJ. Minimizing maximum lateness with job families Working Paper No. 314, The Amos Tuck School of Business Administration, Hanover, NH 03755: Dartmouth College, 1997
Constantopuolos P, Georgiou T, Tsatsakis N. One-machine scheduling with setup times; fast solutions and applications. Advances in Production Management Systems, B-13. Pappas IA, Tatsiopoulos IP, editors. North-Holland: Elsevier Science Publishers B.V., 1993
Williams, 1996, A new heuristic for a single machine problem with setup times, J Oper Res Soc, 47, 175, 10.1057/jors.1996.15
Crauwels, 1997, Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time, An Oper Res, 70, 261, 10.1023/A:1018978322417
Schutten, 1996, Single-machine scheduling with release dates, due dates and family setup times, Manage Sci, 42, 1165, 10.1287/mnsc.42.8.1165
Hariri, 1997, Single machine scheduling with batch set-up times to minimize maximum lateness, An Oper Res, 70, 75, 10.1023/A:1018903027868
Unal, 1992, Batch sequencing, IIE Trans Sched Logist, 24, 73
Sahney, 1972, Single-server, two-machine sequencing with switching time, Oper Res, 20, 24, 10.1287/opre.20.1.24
Gupta, 1984, Optimal schedules for single facility with two job classes, Comp Oper Res, 11, 409, 10.1016/0305-0548(84)90042-X
Potts, 1991, Scheduling two job classes on a single machine, Comp Oper Res, 18, 411, 10.1016/0305-0548(91)90018-M
Gupta, 1988, Single facility scheduling with multiple job classes, Eur J Oper Res, 8, 42, 10.1016/0377-2217(88)90252-4
Psaraftis, 1980, A dynamic programming approach for sequencing groups of identical jobs, Oper Res, 28, 1347, 10.1287/opre.28.6.1347
Ozgur, 1995, A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem, OMEGA, 23, 205, 10.1016/0305-0483(94)00057-H
Sawicki, 1973, The problems of tardiness and saturation in a multi class queue with sequence-dependent setups, AIIE Trans, 5, 250, 10.1080/05695557308974909
Ahn, 1990, Single facility multi-class job scheduling, Comp Oper Res, 17, 265, 10.1016/0305-0548(90)90003-P
Ghosh, 1994, Batch scheduling to minimize total completion time, Oper Res Lett, 16, 271, 10.1016/0167-6377(94)90040-X
Chen, 1997, Scheduling with batch setup times and earliness–tardiness penalties, Eur J Oper Res, 96, 518, 10.1016/S0377-2217(96)00096-3
Tang CS, Wittrock RJ. Parallel machine scheduling with major and minor setups. York Town Heights, NY: RC 11412, IBM TJ Watson Research Center, 1985
Wittrock RJ. Scheduling parallel machines with setups. York Town Heights, NY: RC 11740, IBM TJ Watson Research Center, 1986
Cheng, 1994, Parallel machine scheduling with batch setup times, Oper Res, 42, 1171, 10.1287/opre.42.6.1171
Monma, 1993, Analysis of heuristics for preemptive parallel machine scheduling with batch setup times, Oper Res, 41, 981, 10.1287/opre.41.5.981
So, 1990, Some heuristics for scheduling jobs on parallel machines with setups, Manage Sci, 36, 467, 10.1287/mnsc.36.4.467
Wittrock, 1990, Scheduling parallel machines with major and minor setups, Int J Flex Manufact Syst, 2, 329
Dietrich BL. A Two-phase heuristic for scheduling on parallel unrelated machines with setups. York Town Heights, NY: RC 14330, IBM TJ Watson Research Center, 1989
Schutten, 1996, Parallel machine scheduling with release dates, due dates and family setup times, Int J Prod Econ, 46–47, 119, 10.1016/0925-5273(95)00086-0
Brucker P, Kovalyov MY, Shafransky YM, Werner F. Batch scheduling with deadlines and parallel machines. An Oper Res, to appear
Marsh JD, Montgomery DC. Optimal procedures for scheduling jobs with sequence-dependent changeover times on parallel processors. AIIE Technical Papers, 1973, p. 279–286
Deane, 1975, Balancing workloads and minimizing setup costs in the parallel processing shop, Oper Res Q, 26, 45, 10.1057/jors.1975.6
Geoffrion, 1976, Scheduling parallel production lines with changeover costs: Practical application of a quadratic assignment/LP approach, Oper Res, 24, 595, 10.1287/opre.24.4.595
Guinet, 1990, Textile production systems: a succession of non-identical parallel processor shops, J Oper Res Soc, 42, 655, 10.1057/jors.1991.132
Elmaghraby SE, Guinet A, Schellenberger KW. Sequencing on parallel processors: an alternate approach. OR Technical Report No. 273, Raleigh, NC: North Carolina State University, 1993
Parker, 1977, On the use of a vehicle routing algorithm for the parallel processor problems with sequence dependent changeover costs, AIIE Trans, 9, 155, 10.1080/05695557708975137
Dearing, 1984, Assigning looms in a textile weaving operation with changeover limitations, Prod Inv Manage, 25, 23
Sumichrast, 1987, Scheduling parallel processors: an integer linear programming based heuristic for minimizing setup time, Int J Prod Res, 25, 761, 10.1080/00207548708919875
Ovacik, 1993, Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times, Oper Res Lett, 14, 251, 10.1016/0167-6377(93)90089-Y
Ovacik, 1995, Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times, Int J Prod Res, 33, 3173, 10.1080/00207549508904867
Guinet, 1993, Scheduling sequence dependent jobs on identical parallel machines to minimize completion time criteria, Int J Prod Res, 31, 1579, 10.1080/00207549308956810
Lee, 1997, Scheduling jobs on parallel machines with sequence dependent setup times, Eur J Oper Res, 100, 464, 10.1016/S0377-2217(95)00376-2
Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Res Logist Q, 1, 61, 10.1002/nav.3800010110
Corwin, 1974, Two-machine flowshop scheduling problems with sequence dependent setup times: a dynamic programming approach, Naval Res Logist Q, 21, 515, 10.1002/nav.3800210311
Yoshida, 1979, Optimal two-stage production scheduling with setup times separated, AIIE Trans, 11, 261, 10.1080/05695557908974469
Gupta, 1985, Approximate schedules for the two-machine flowshop with sequence dependent setup times, Indian J Manage Syst, 1, 6
Gupta, 1972, Optimal scheduling in multistage flowshop, AIIE Trans, 4, 238, 10.1080/05695557208974856
Dell'Amico, 1996, Shop problems with two machines and time lags, Oper Res, 44, 777, 10.1287/opre.44.5.777
Strusevich, 1994, On non-permutation solutions to some two-machine flow shop scheduling models, Z Oper Res, 39, 305
Gupta, 1994, Scheduling a two-stage hybrid flowshop with separable setup and removal times, Eur J Oper Res, 77, 415, 10.1016/0377-2217(94)90407-3
Sule, 1982, Sequencing n jobs on two machines with setup, processing and removal times separated, Naval Res Logist Q, 29, 517, 10.1002/nav.3800290313
Hall, 1996, A survey of machine scheduling problems with blocking and no-wait in process, Oper Res, 44, 510, 10.1287/opre.44.3.510
Aldowaisan T, Allahverdi A. Total flowtime in no-wait flowshops with separated setup times. Comput Oper Res, 1988;25:757–65
Khurana, 1985, Scheduling of job-block with deadline in n×2 flowshop problem with separated setup times, Indian J Pure Appl Math, 16, 213
Allahverdi, 1995, Two-stage production scheduling with separated set-up times and stochastic breakdowns, J Oper Res Soc, 46, 896, 10.1057/jors.1995.122
Allahverdi, 1997, Scheduling in stochastic flowshops with independent setup, processing and removal times, Comput Oper Res, 24, 955, 10.1016/S0305-0548(97)00006-3
Proust, 1991, Flowshop scheduling with set-up, processing and removal times separated, Int J Prod Res, 29, 479, 10.1080/00207549108930084
Rajendran, 1997, Heuristics for scheduling in a flowshop with setup, processing, and removal times separated, Prod Planning Control, 8, 568, 10.1080/095372897234902
Khurana, 1984, Minimizing the makespan in a two-machine flowshop with time lags and setup conditions, Z Oper Res, 28, 163, 10.1007/BF01920918
Szwarc, 1986, The flowshop problem with time lags and separated setup times, ZOR-Z Oper Res, 30, B15, 10.1007/BF01919496
Nabeshima, 1984, Two- and three-machine flowshop makespan scheduling problems with additional times separated from processing times, J Oper Res Soc Jpn, 27, 348, 10.15807/jorsj.27.348
Dileepan, 1991, Job lateness in a two-machine flowshop with setup times separated, Comput Oper Res, 18, 549, 10.1016/0305-0548(91)90060-5
Allahverdi A, Aldowaisan T. Job lateness in flowshops with setup and removal times separated. J Oper Res Soc, to appear
Allahverdi A. Minimizing mean flowtime in a two- machine flowshop with sequence independent setup times. Comput Oper Res, revised
Gupta, 1997, Two-stage no-wait scheduling models with setup and removal times, Comput Oper Res, 24, 1025, 10.1016/S0305-0548(97)00018-X
Cao, 1992, Flow shop scheduling in serial multi-product processes with transfer and set-up times, Int J Prod Res, 30, 1819, 10.1080/00207549208948124
Park, 1991, Analysis of heuristics for job sequencing in manufacturing flow line work-cells, Comput Ind Eng, 20, 129, 10.1016/0360-8352(91)90048-B
Uskup, 1975, A branch and bound for two-stage production sequencing, Oper Res, 23, 118, 10.1287/opre.23.1.118
Gupta, 1986, The two-machine sequence dependent flowshop scheduling problem, Eur J Oper Res, 24, 439, 10.1016/0377-2217(86)90037-8
Gupta, 1986, Flowshop schedules with sequence dependent setup times, J Oper Res Soc Jpn, 29, 206, 10.15807/jorsj.29.206
Gupta, 1975, A search algorithm for the generalized scheduling problem, Comput Oper Res, 2, 83, 10.1016/0305-0548(75)90011-8
Stafford, 1990, On the Srikar–Ghosh MILP model for the NxM SDST flowshop problem, Int J Prod Res, 28, 1817, 10.1080/00207549008942836
Rios-Mercado RZ, Bard FB. The flowshop scheduling polyhedron with setup times. Technical Report ORP96-07, Graduate Program in Operations Research. Austin, TX 78712-1063: University of Texas at Austin, 1996
Gupta JND, Das SR, Ghosh S. Flowshop Scheduling with Sequence Dependent Setup Times. Working paper, Department of Management. Muncie, IN 47306: Ball State University, 1995
Rios-Mercado RZ, Bard FB. Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Comput Oper Res, 1988;25:351–66
Gupta JND. Flowshop Scheduling with Sequence Dependent Setup Times. Proceedings of the ORSA/TIMS national meeting, Washington, DC, April 1988
Simons, 1992, Heuristics in flow shop scheduling with sequence dependent setup times, Omega, 20, 215, 10.1016/0305-0483(92)90075-I
Rios-Mercado RZ, Bard FB. An enhanced TSP-based heuristic for makespan minimization in a flowshop with setup times. Technical Report ORP97-08, Graduate Program in Operations Research, Austin, TX 78712-1063: University of Texas at Austin, (1997)
Rios-Mercado RZ, Bard FB. Heuristics for the flow line problem with setup costs. Eur J Oper Res, to appear
Parthasarathy, 1997, A simulated annealing heuristic for scheduling to minimize weighted tardiness in a flowshop with sequence dependent setup times of jobs – a case study, Prod Planning Control, 8, 475, 10.1080/095372897235055
Parthasarathy, 1997, An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence dependent setup times of jobs, Int J Prod Econ, 49, 255, 10.1016/S0925-5273(97)00017-0
Rajagopalan D, Karimi IA. Scheduling in serial mixed-storage multiproduct processes with transfer and set-up times. Foundations of Computer Aided Process Operations, Reklaitis GV, Spriggs HD, editors. New York: Elsevier Science Publishers, 1987, p. 679–686
Szwarc, 1987, A flow-shop problem with sequence-dependent additive setup times, Naval Res Logist, 34, 619, 10.1002/1520-6750(198710)34:5<619::AID-NAV3220340503>3.0.CO;2-B
Baker, 1990, Scheduling groups of jobs in the two-machine flowshop, Math Comput Model, 13, 29, 10.1016/0895-7177(90)90368-W
Hitomi, 1976, Operations scheduling for group technology applications, CIRP An, 25, 419
Hitomi K, Nakamura N, Yoshida T, Okuda K. An Experimental Investigation of Group Production Scheduling. Proceedings of the 4th International Conference on Production Research, Tokyo, 1977, p. 608–617
Vakharia, 1990, A simulated annealing approach to scheduling a manufacturing cell, Naval Res Logist, 37, 559, 10.1002/1520-6750(199008)37:4<559::AID-NAV3220370409>3.0.CO;2-8
Skorin-Kapov, 1993, Scheduling a flow-line manufacturing cell: a tabu search approach, Int J Prod Res, 31, 1721, 10.1080/00207549308956819
Sridhar, 1994, A genetic algorithm for family and job scheduling a flow-line based manufacturing cell, Comput Ind Eng, 27, 469, 10.1016/0360-8352(94)90336-0
Zdrzalka S. Two-machine flow shop scheduling problem with family setup times. Report no. 16/95, Institute of Engineering Cybernetics, Technical University of Wroclaw, Poland, 1995
Sotoskov, 1996, Heuristics for permutation flowshop scheduling with batch setup times, OR Spektrum, 18, 67, 10.1007/BF01539731
Danneberg D, Tautenhahn T, Werner F. A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Preprint. Magdeburg, Germany: Otto-von-Guericke University, 1998
Li, 1997, A hybrid two-stage flowshop with part family, batch production, major and minor set-ups, Eur J Oper Res, 102, 142, 10.1016/S0377-2217(96)00213-5
Vakharia AJ, Schaller JE, Gupta JND. Designing and scheduling manufacturing cells. Proceedings of the INFORMS national meeting, New Orleans, LA, October 1995
Schaller JE, Gupta JND, Vakharia AJ. Group scheduling with sequence dependent setups. Proceedings of the Annual Decision Sciences Institute Meeting, San Diego, CA, November 1997, p. 1141–1143
Hershauer JC. An empirically-derived simulation to explore sequencing decisions. Ph.D. Thesis, Indiana University, 1970
Flynn BB. Group technology vs. process layout: a comparison using computerized job shop simulation. Ph.D. Thesis, Indiana University, 1984
Low, 1995, Job shop scheduling heuristics for sequence-dependent setups, Comput Ind Eng, 29, 279, 10.1016/0360-8352(95)00085-F
O'Grady, 1988, Search based job scheduling and sequencing with setup times, Omega Int J Manage Sci, 16, 547, 10.1016/0305-0483(88)90028-X
Zhou, 1989, Scheduling in a manufacturing shop with sequence-dependent setups, Robotics Comput-Integr Manufact, 5, 73, 10.1016/0736-5845(89)90031-8
Choi, 1997, Job shop scheduling with separable sequence-dependent setups, An Oper Res, 70, 155, 10.1023/A:1018918003761
Gupta, 1982, n jobs and m machines job-shop problems with sequence dependent setup times, Int J Prod Res, 20, 643, 10.1080/00207548208947793
Brucker P, Thiele O. A branch and bound algorithm for the general job shop with sequence dependent setup times. OR Spektrum, 1996;18
Strusevich, 1993, Two machine open shop scheduling problem with setup, processing and removal times separated, Comput Oper Res, 20, 597, 10.1016/0305-0548(93)90115-Y