Scheduling and lot sizing with sequence-dependent setup: A literature review

IIE Transactions (Institute of Industrial Engineers)

Volumn 38, Issue 11, 2006, Pages 987-1007

  Zhu, Xiaoyan ^a   Wilhelm, Wilbert E ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MACHINERY; OPERATIONS RESEARCH; OPTIMIZATION; SCHEDULING; SPECIFICATIONS;

FLOW SHOP; JOB SHOP SYSTEMS; LOT SIZING; SEQUENCE-DEPENDENT SETUP;

INDUSTRIAL MANAGEMENT;

EID: 33748492325     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170600559706     Document Type: Review

References (182)

1. Adams, J. and Balas, E. and Zawack, D. (1988) The shifting bottleneck procedure for job shop scheduling Management Science, 34, pp. 391-401. http://www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=34&iss=&firstpage=391
2. Aldowaisan, T. and Allahverdi, A. (2003) New heuristics for no-wait flow shops to minimize makespan Computers & Operations Research, 30, pp. 1219-1231. http://dx.doi.org/10.1016%2FS0305-0548%2802%2900068-0 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=30&iss=&firstpage=1219 [CSA]
3. Alidaee, B. and Kochenberger, G. and Amini, M. (2001) Greedy solutions of selection and ordering problems European Journal of Operational Research, 134, pp. 203-215. http://dx.doi.org/ 10.1016%2FS0377-2217%2800%2900252-6 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=134&iss=&firstpage=203 [CSA]
4. Allahverdi, A. and Gupta, J. and Aldowaisan, T. (1999) A review of scheduling research involving setup considerations Omega, 27(2), pp. 219-239. http://dx.doi.org/10.1016%2FS0305-0483%2898%2900042-5 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0030-2228&vol=27&iss=2&firstpage=219 [CSA]
5. Anglani, A. and Grieco, A. and Guerriero, E. and Musmanno, R. (2005) Robust scheduling of parallel machines with sequence-dependent set-up costs European Journal of Operational Research, 161, pp. 704-720. http:// dx.doi.org/10.1016%2Fj.ejor.2003.08.059 [CROSSREF] http://www.csa.com/ htbin/linkabst.cgi?issn=0377-2217&vol=161&iss=&firstpage=704 [CSA]
6. Artigues, C. and Roubellat, O. (2002) An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times Production Planning & Control, 13(2), pp. 175-186. http://dx.doi.org/10.1080%2F09537280110069757 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0953-7287&vol=13&iss=2&firstpage=175 [CSA]
7. Arzi, Y. and Raviv, D. (1998) Dispatching in a workstation belonging to a re-entrant production line under sequence-dependent set-up times Production Planning & Control, 9(7), pp. 690-699. http://dx.doi.org/ 10.1080%2F095372898233696 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0953-7287&vol=9&iss=7&firstpage=690 [CSA]
8. Asano, M. and Ohta, H. (1996) Single machine scheduling using dominance relation to minimize earliness subject to ready and due times International Journal of Production Economics, 44(1/2), pp. 35-43. http:/ /dx.doi.org/10.1016%2F0925-5273%2895%2900090-9 [CROSSREF] http:// www.csa.com/htbin/linkabst.cgi?issn=0925-5273&vol=44&iss=1/ 2&firstpage=35 [CSA]
9. Asano, M. and Ohta, H. (1999) Scheduling with shutdowns and sequence dependent setup times International Journal of Production Research, 37(7), pp. 1661-1676. http://dx.doi.org/10.1080%2F002075499191184 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=37&iss=7&firstpage=1661[CSA]
10. Aytug, H. and Lawley, M. and McKay, K. and Mohan, S. and Uzsoy, R. (2005) Executing production schedules in the face of uncertainties: A review and some future directions European Journal of Operational Research, 161, pp. 86-110. http://dx.doi.org/ 10.1016%2Fj.ejor.2003.08.027 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=161&iss=&firstpage=86 [CSA]
11. Balakrishnan, N. and Kanet, J. and Sridharan, S. (1999) Early/tardy scheduling with sequence dependent setups on uniform parallel machines Computers & Operations Research, 26(2), pp. 127-141. http:// dx.doi.org/10.1016%2FS0305-0548%2898%2900051-3 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=26&iss=2&firstpage=127 [CSA]
12. Balas, E. (1969) Machine sequencing via disjunctive graphs: An implicit enumeration approach Operations Research, 17, pp. 941-957. http:// www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=17&iss=&firstpage=941 [CSA]
13. Barnes, J. and Vanston, L. (1981) Scheduling jobs with linear delay penalties and sequence dependent setup costs Operations Research, 29, pp. 146-154. http://www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=29&iss=&firstpage=146 [CSA]
14. Bianco, L. and Dell'Olmo, P. and Giordani, S. (1999) Flowshop no-wait scheduling with sequence-dependent setup times and release dates INFOR, 37(1), pp. 3-19. http://www.csa.com/htbin/ linkabst.cgi?issn=0812-9304&vol=37&iss=1&firstpage=3 [CSA]
15. Bilge, U. and Klrac, F. and Kurtulan, M. and Pekgü, P. (2004) A tabu search algorithm for parallel machine total tardiness problem Computers & Operations Research, 31(3), pp. 397-414. http:// dx.doi.org/10.1016%2FS0305-0548%2802%2900198-3 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=31&iss=3&firstpage=397 [CSA]
16. Bitran, G. and Gilbert, S. (1990) Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost Journal of Manufacturing Operations Management, 3, pp. 24-52. http://www.csa.com/ htbin/linkabst.cgi?issn=&vol=3&iss=3&firstpage=24 [CSA]
17. Blocher, J. and Chand, S. and Sengupta, K. (1999) The changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm Operations Research, 47(4), pp. 559-569. http:// www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=47&iss=4&firstpage=559 [CSA]
18. Candido, M. and Khator, S. and Barcia, R. (1998) A genetic algorithm based procedure for more realistic job shop scheduling problems International Journal of Production Research, 36(12), pp. 3437-3457. http://dx.doi.org/10.1080%2F002075498192148 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=36&iss=12&firstpage=3437 [CSA]
19. Cattrysse, D. and Salomon, M. and Kuik, R. and Van Wassenhove, L. (1993) A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times Management Science, 39(4), pp. 477-486. http://www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=39&iss=4&firstpage=477 [CSA]
20. Chen, Z.-L. (1997) Scheduling with batch setup times and earliness-tardiness penalties European Journal of Operational Research, 96, pp. 518-537. http://dx.doi.org/10.1016%2FS0377-2217%2896%2900096-3 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=96&iss=&firstpage=518 [CSA]
21. Cheng, T. and Chen, Z.-L. (1994) Parallel machine scheduling with batch setup times Operations Research, 42(6), pp. 1171-1174. http:// www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=42&iss=6&firstpage=1171 [CSA]
22. Cheng, T. and Gupta, J. and Wang, G. (2000) A review of flowshop scheduling with setup times Production and Operations Management, 9(3), pp. 262-282. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=9&iss=6&firstpage=262 [CSA]
23. Cheung, W. and Zhou, H. (2002) Using generic algorithms and heuristics for job shop scheduling with sequence-dependent setup times Annals of Operations Research, 107, pp. 65-81. http://dx.doi.org/ 10.1023%2FA%3A1014990729837 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0254-5330&vol=107&iss=&firstpage=65 [CSA]
24. Choi, I. and Choi, D. (2002) A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups Computers & Industrial Engineering, 42(1), pp. 43-58. http:// dx.doi.org/10.1016%2FS0360-8352%2802%2900002-5 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=&vol=42&iss=&firstpage=43 [CSA]
25. Choi, I. and Kim, S. and Kim, H. (2003) A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem Computers & Operations Research, 30(5), pp. 773-786. http://dx.doi.org/ 10.1016%2FS0305-0548%2802%2900050-3 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=30&iss=5&firstpage=773 [CSA]
26. Choi, I. and Korkmaz, O. (1997) Job shop scheduling with sequence-dependent setups Annals of Operations Research, 70, pp. 155-170. http://dx.doi.org/10.1023%2FA%3A1018918003761 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0254-5330&vol=70&iss=&firstpage=155 [CSA]
27. Coffman, E., Jr. and Garey, M. and Johnson, D. (1978) An application of bin-packing to multiprocessor scheduling SIAM Journal on Computing, 7, pp. 1-17. http://dx.doi.org/10.1137%2F0207001 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=1064-8275&vol=7&iss=&firstpage=1 [CSA]
28. Coleman, J. (1992) A simple model for optimizing the single machine early/tardy problem with sequence-dependent setups Production and Operations Management, 1(2), pp. 225-228. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=1&iss=&firstpage=225 [CSA]
29. Das, S. and Gupta, J. and Khumawala, B. (1995) A saving index heuristic algorithm for flowshop scheduling with sequence-dependent setup times Journal of the Operational Research Society, 46, pp. 1365-1373. http:// dx.doi.org/10.2307%2F2584570 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0160-5682&vol=46&iss=&firstpage=1365 [CSA]
30. Dastidar, G. and Nagi, R. (2005) Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs Computers & Operations Research, 32, pp. 2987-3005. http:// dx.doi.org/10.1016%2Fj.cor.2004.04.012 [CROSSREF] http://www.csa.com/ htbin/linkabst.cgi?issn=0305-0548&vol=32&iss=&firstpage=2987 [CSA]
31. Delporte, C. and Thomas, L. (1977) Lot sizing and sequencing for N products on one facility Management Science, 23(10), pp. 1070-1079. http://www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=23&iss=10&firstpage=1070 [CSA]
32. Demirkol, E. and Uzsoy, R. (2000) Decomposition methods for reentrant flow shops with sequence-dependent setup times Journal of Scheduling, 3(3), pp. 155-177. http://dx.doi.org/10.1002%2F%28SICI%291099- 1425%28200005%2F06%293%3A3%3C155%3A%3AAID-JOS39%3E3.0.CO%3B2-E [CROSSREF] http://www.csa.com/htbin/
33. Dhaenens-Flipo, C. (2001) A bicriterion approach to deal with a constrained single-objective problem International Journal of Production Economics, 74, pp. 93-101. http://dx.doi.org/ 10.1016%2FS0925-5273%2801%2900110-4 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0925-5273&vol=74&iss=&firstpage=93 [CSA]
34. Dobson, G. (1992) The cyclic lot scheduling problem with sequence-dependent setups Operations Research, 40(4), pp. 736-749. http:/ /www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=40&iss=4&firstpage=736 [CSA]
35. Dobson, G. and Karmarkar, U. and Rummel, J. (1987) Batching to minimize flow times on one machine Management Science, 33, pp. 784-799. http:// www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=33&iss=&firstpage=784 [CSA]
36. Drexl, A. and Kimms, A. (1997) Lot sizing and scheduling - survey and extensions European Journal of Operational Research, 99, pp. 221-235. http://dx.doi.org/10.1016%2FS0377-2217%2897%2900030-1 [CROSSREF]http:// www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=99&iss=&firstpage=221 [CSA]
37. Feo, T. and Bard, J. and Holland, S. (1995) Facility-wide planning and scheduling of printed wiring board assembly Operations Research, 43(2), pp. 219-230. http://www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=43&iss=2&firstpage=219 [CSA]
38. Feo, T. and Sarathy, K. and McGahan, J. (1996) A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties Computers & Operations Research, 23(9), pp. 881-895. http:/ /dx.doi.org/10.1016%2F0305-0548%2895%2900084-4 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=23&iss=9&firstpage=881 [CSA]
39. Fleischmann, B. (1990) The discrete lot-sizing and scheduling problem European Journal of Operations Research, 44, pp. 337-348. http:// dx.doi.org/10.1016%2F0377-2217%2890%2990245-7 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=&vol=44&iss=9&firstpage=337[CSA]
40. Fleischmann, B. (1994) The discrete lot-sizing and scheduling problem with sequence-dependent setup costs European Journal of Operational Research, 75(2), pp. 395-404. http://dx.doi.org/ 10.1016%2F0377-2217%2894%2990083-3 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=75&iss=2&firstpage=395 [CSA]
41. Fleischmann, B. and Meyr, H. (1997) The general lotsizing and scheduling problem OR Spektrum, 19(1), pp. 11-21. http://www.csa.com/htbin/ linkabst.cgi?issn=0171-6468&vol=19&iss=1&firstpage=11 [CSA]
42. França, P. and Gendreau, M. and Laporte, G. and Muller, F. (1996) A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times International Journal of Production Economics, 43(2/3), pp. 79-89. http://www.csa.com/htbin/ linkabst.cgi?issn=0925-5273&vol=43&iss=2/3&firstpage=79 [CSA]
43. França, P. and Gupta, J. and Mendes, A. and Moscato, P. and Veltink, K. (2005) Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups Computers & Industrial Engineering, 48, pp. 491-506. http://dx.doi.org/ 10.1016%2Fj.cie.2003.11.004 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=48&iss=2/3&firstpage=491 [CSA]
44. França, P. and Mendes, A. and Moscato, P. (2001) A memetic algorithm for the total tardiness single machine scheduling problem European Journal of Operational Research, 132, pp. 224-242. http:// dx.doi.org/10.1016%2FS0377-2217%2800%2900140-5 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=132&iss=&firstpage=224 [CSA]
45. Gendreau, M. and Laporte, G. and Guimarces, E. (2001) A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times European Journal of Operational Research, 133(1), pp. 183-189. http://dx.doi.org/10.1016%2FS0377-2217%2800%2900197-1 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=133&iss=1&firstpage=183 [CSA]
46. Ghosh, J. (1994) Batch scheduling to minimize total completion time Operations Research Letters, 16, pp. 271-275. http://dx.doi.org/ 10.1016%2F0167-6377%2894%2990040-X [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0167-6377&vol=16&iss=&firstpage=271 [CSA]
47. Glover, F. (1989) Tabu search - Part I ORSA Journal on Computing, 1, pp. 190-206. http://www.csa.com/htbin/ linkabst.cgi?issn=0899-1499&vol=1&iss=&firstpage=190 [CSA]
48. Glover, F. (1990) Tabu search - Part II ORSA Journal on Computing, 2, pp. 40-42. http://www.csa.com/htbin/ linkabst.cgi?issn=0899-1499&vol=2&iss=&firstpage=40 [CSA]
49. Graham, R. and Lawler, E. and Lenstra, J. and Rinnooy Kan, A. (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey Annals of Discrete Mathematics, 5, pp. 287-326. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=5&iss=&firstpage=287 [CSA]
50. Guinet, A. (1993) Scheduling sequence-dependent jobs on identical parallel machines to minimize completion criteria International Journal of Production Research, 31, pp. 1579-1594. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=31&iss=&firstpage=1579 [CSA]
51. Gupta, A. and Sivakumar, A. (2005) Single machine scheduling with multiple objectives in semiconductor manufacturing The International Journal of Advanced Manufacturing Technology, 26, pp. 950-958. http:// www.csa.com/htbin/ linkabst.cgi?issn=0268-3768&vol=26&iss=&firstpage=950 [CSA]
52. Gupta, D. and Magnusson, T. (2005) The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times Computers & Operations Research, 32(4), pp. 727-747. http:// www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=32&iss=4&firstpage=727 [CSA]
53. Gupta, J. (1986) Flowshop schedules with sequence dependent setup times Journal of the Operations Research Society of Japan, 29, pp. 206-219. http://www.csa.com/htbin/ linkabst.cgi?issn=0453-4514&vol=29&iss=&firstpage=206 [CSA]
54. Gupta, J. and Darrow, W. (1986) The two-machine sequence dependent flowshop scheduling problem European Journal of Operational Research, 24, pp. 439-446. http://dx.doi.org/10.1016%2F0377-2217%2886%2990037-8 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=24&iss=&firstpage=439 [CSA]
55. Gupta, S. (1982) n jobs and m machines job-shop problems with sequence-dependent setup times International Journal of Production Research, 20(5), pp. 643-656. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=20&iss=5&firstpage=643 [CSA]
56. Haase, K.(1994) Lotsizing and scheduling for production planning (Lecture Notes in Economics and Mathematical Systems). Berlin: Springer-Verlag.
57. Haase, K. (1996) Capacitated lotsizing with sequence dependent setup costs Operations Research Spektrum, 18, pp. 51-59. http://dx.doi.org/ 10.1007%2FBF01539882 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0171-6468&vol=18&iss=&firstpage=51 [CSA]
58. Haase, K. and Kimms, A. (2000) Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities International Journal of Production Economics, 66(2), pp. 159-169. http://dx.doi.org/10.1016%2FS0925-5273%2899%2900119-X [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0925-5273&vol=66&iss=2&firstpage=159 [CSA]
59. Hashiba, S. and Chang, T. (1991) PCB assembly set-up reduction using group technology Computers & Industrial Engineering, 21(1/4), pp. 453-457. http://dx.doi.org/10.1016%2F0360-8352%2891%2990134-R [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=21&iss=2&firstpage=453 [CSA]
60. Heady, R. and Zhu, Z. (1998) Minimizing the sum of job earliness and tardiness in a multimachine system International Journal of Production Research, 36(6), pp. 1619-1632. http://dx.doi.org/ 10.1080%2F002075498193192 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=36&iss=6&firstpage=1619 [CSA]
61. Hertz, A. and Widmer, M. (1996) An improved tabu search approach for solving the job shop scheduling problem with tooling constraints Discrete Applied Mathematics, 65, pp. 319-345. http://dx.doi.org/ 10.1016%2F0166-218X%2895%2900040-X [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0166-218X&vol=65&iss=&firstpage=319 [CSA]
62. Hop, N. and Nagarur, N. (2004) The scheduling problem of PCBs for multiple non-identical parallel machines European Journal of Operational Research, 158, pp. 577-594. http://dx.doi.org/ 10.1016%2FS0377-2217%2803%2900376-X [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=158&iss=&firstpage=577 [CSA]
63. Hui, C. and Gupta, A. and Van der Meulen, H. (2000) A novel MILP formulation for short-term scheduling of multistage multi-product batch plants Computers & Chemical Engineering, 24(2/7), pp. 1611-1617. http://dx.doi.org/10.1016%2FS0098-1354%2800%2980012-5 [CROSSREF] http:// www.csa.com/htbin/linkabst.cgi?issn=0098-1354&vol=24&iss=2/ 7&firstpage=1611 [CSA]
64. Hurink, J. and Knust, S. (2001) List scheduling in a parallel machine environment with precedence constraints and setup times Operations Research Letters, 29(5), pp. 231-239. http://dx.doi.org/ 10.1016%2FS0167-6377%2801%2900104-3 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0167-6377&vol=29&iss=5&firstpage=231 [CSA]
65. Hwang, H. and Sun, J. (1997) Production sequencing problem with reentrant work flows and sequence dependent setup times Computers & Industrial Engineering, 33(3/4), pp. 773-776. http://dx.doi.org/ 10.1016%2FS0360-8352%2897%2900250-7 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=33&iss=5&firstpage=773 [CSA]
66. Hwang, H. and Sun, J. (1998) Production sequencing problem with re-entrant work flows and sequence dependent setup times International Journal of Production Research, 36(9), pp. 2435-2450. http://dx.doi.org/ 10.1080%2F002075498192616 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=36&iss=9&firstpage=2435 [CSA]
67. Johnson, D. and Papadimitriou, C.(1985) Computational complexity. In The Traveling Salesman Problem. (pp. 37-85). Chichester UK: Wiley.
68. Johnson, S. (1954) Optimal two-and three-stage production schedules with set-up times included Naval Research Logistics Quarterly, 1, pp. 61-68. http://www.csa.com/htbin/ linkabst.cgi?issn=0028-1441&vol=1&iss=&firstpage=61 [CSA]
69. Jordan, C. and Drexl, A. (1998) Discrete lotsizing and scheduling by batch sequencing Management Science, 44(5), pp. 698-713. http:// www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=44&iss=5&firstpage=698 [CSA]
70. Kang, S. and Malik, K. and Thomas, L. (1999) Lotsizing and scheduling on parallel machines with sequence-dependent setup costs Management Science, 45(2), pp. 273-289. http://www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=45&iss=2&firstpage=273 [CSA]
71. Karimi, B. and Fatemi Ghomi, S. and Wilson, J. (2003) The capacitated lot-sizing problem: A review of models and algorithms Omega, 31, pp. 365-378. http://dx.doi.org/10.1016%2FS0305-0483%2803%2900059-8 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0030-2228&vol=31&iss=&firstpage=365 [CSA]
72. Kim, C. and Shin, H. (2003) Scheduling jobs on parallel machines: A restricted tabu search approach The International Journal of Advanced Manufacturing Technology, 22(3/4), pp. 278-287. http://dx.doi.org/ 10.1007%2Fs00170-002-1472-2 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0268-3768&vol=22&iss=3/4&firstpage=278 [CSA]
73. Kim, D. and Kim, K. and Jang, W. and Chen, F. (2002) Unrelated parallel machine scheduling with setup times using simulated annealing Robotics and Computer-Integrated Manufacturing, 18(3/4), pp. 223-231. http:// dx.doi.org/10.1016%2FS0736-5845%2802%2900013-3 [CROSSREF] http:// www.csa.com/htbin/linkabst.cgi?issn=0736-5845&vol=18&iss=3/ 4&firstpage=223 [CSA]
74. Kim, S. and Bobrowski, P. (1994) Impact of sequence-dependent setup time on job shop scheduling performance International Journal of Production Research, 32(7), pp. 1503-1520. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=32&iss=7&firstpage=1503 [CSA]
75. Kim, S. and Bobrowski, P. (1997) Scheduling jobs with uncertain setup times and sequence dependency Omega, 25(4), pp. 437-447. http:// dx.doi.org/10.1016%2FS0305-0483%2897%2900013-3 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0030-2228&vol=25&iss=4&firstpage=437 [CSA]
76. Kim, S.-S. and Shin, H. and Eom, D.-H. and Kim, C.-O. (2003) A due date density-based categorising heuristic for parallel machines scheduling The International Journal of Advanced Manufacturing Technology, 22(9/ 10), pp. 753-760. http://dx.doi.org/10.1007%2Fs00170-003-1611-4 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0268-3768&vol=22&iss=9/10&firstpage=753 [CSA]
77. Kim, S.-Y. and Lee, Y.-H. and Agnihotri, D. (1995) A hybrid approach to sequencing jobs using heuristic rules and neural networks Production Planning & Control, 6(5), pp. 445-454. http://www.csa.com/htbin/ linkabst.cgi?issn=0953-7287&vol=6&iss=5&firstpage=445 [CSA]
78. Kim, Y. and Lim, H. and Park, M. (1996) Search heuristics for a flow shop scheduling problem in a printed circuit board assembly process European Journal of Operational Research, 91(1), pp. 124-143. http:// dx.doi.org/10.1016%2F0377-2217%2895%2900119-0 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=91&iss=1&firstpage=124 [CSA]
79. Kirkpatrick, S. and Gelatt, C. and Vecchi, M. (1983) Optimization by simulated annealing Science, 220, pp. 671-680. http://www.csa.com/htbin/ linkabst.cgi?issn=0294-0337&vol=220&iss=&firstpage=671 [CSA]
80. Kochhar, S. and Morris, R. (1987) Heuristic methods for flexible flow line scheduling Journal of Manufacturing Systems, 6(4), pp. 299-314. http://www.csa.com/htbin/ linkabst.cgi?issn=0278-6125&vol=6&iss=4&firstpage=299 [CSA]
81. Kolahan, F. and Liang, M. (1998) An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups European Journal of Operational Research, 109, pp. 142-159. http:// dx.doi.org/10.1016%2FS0377-2217%2897%2900098-2 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=109&iss=&firstpage=142 [CSA]
82. Kolahan, F. and Liang, M. and Zuo, M. (1995) Solving the combined part sequencing and tool replacement problem for an automated machine center: a tabu search approach Computers & Industrial Engineering, 28, pp. 731-743. http://dx.doi.org/10.1016%2F0360-8352%2895%2900018-V [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=28&iss=&firstpage=731 [CSA]
83. Kurz, M. and Askin, R. (2001) Heuristic scheduling of parallel machines with sequence-dependent set-up times International Journal of Production Research, 39(16), pp. 3747-3769. http://dx.doi.org/ 10.1080%2F00207540110064938 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=39&iss=16&firstpage=3747 [CSA]
84. Kurz, M. and Askin, R. (2003) Comparing scheduling rules for flexible flow lines International Journal of Production Economics, 85(3), pp. 371-388. http://dx.doi.org/10.1016%2FS0925-5273%2803%2900123-3 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0925-5273&vol=85&iss=3&firstpage=371 [CSA]
85. Kurz, M. and Askin, R. (2004) Scheduling flexible flow lines with sequence-dependent setup times European Journal of Operational Research, 159, pp. 66-82. http://dx.doi.org/10.1016%2FS0377-2217%2803%2900401-6 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=159&iss=&firstpage=66 [CSA]
86. Laguna, M. (1999) A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times IIE Transactions, 31(2), pp. 125-134. http://dx.doi.org/ 10.1023%2FA%3A1007560417495 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0740-817X&vol=31&iss=2&firstpage=125 [CSA]
87. Laguna, M. and Glover, F. (1993) Integrating target analysis and tabu search for improved scheduling systems Expert Systems with Applications, 6, pp. 287-297. http://dx.doi.org/10.1016%2F0957-4174%2893%2990056-C [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0957-4174&vol=6&iss=&firstpage=287 [CSA]
88. Lee, I. and Sikora, R. and Shaw, M. (1997) A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes IEEE Transactions on System, Man, and Cybernetics - Part B: Cybernetics, 27(1), pp. 36-54. http://dx.doi.org/10.1109%2F3477.552184 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=27&iss=&firstpage=36 [CSA]
89. Lee, Y. and Bhaskaran, K. and Pinedo, M.(1992) A heuristic to minimize the total weighted tardiness with sequence dependent setups. IEOR Department, Columbia University. Technical Report
90. Lee, Y. and Bhaskaran, K. and Pinedo, M. (1997) A heuristic to minimize the total weighted tardiness with sequence-dependent setups IIE Transactions, 29(1), pp. 45-52. http://www.csa.com/htbin/ linkabst.cgi?issn=0740-817X&vol=29&iss=1&firstpage=45 [CSA]
91. Lee, Y. and Pinedo, M. (1997) Scheduling jobs on parallel machines with sequence-dependent setup times European Journal of Operational Research, 100, pp. 464-474. http://dx.doi.org/10.1016%2FS0377-2217%2895%2900376-2 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=100&iss=&firstpage=464 [CSA]
92. Leon, V. and Wu, S. (1992) On scheduling with ready-times, due-dates and vacations Naval Research Logistics, 39, pp. 53-65. http://www.csa.com/ htbin/linkabst.cgi?issn=0028-1441&vol=39&iss=&firstpage=53 [CSA]
93. Little, J. and Murty, K. and Sweeney, D. and Karel, C. (1963) An algorithm for the traveling salesman problem Operations Research, 11, pp. 972-989. http://www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=11&iss=&firstpage=972 [CSA]
94. Logendran, R. and Gelogullari, C. and Sriskandarajah, C. (2003) Minimizing the mean flow time in a two-machine group-scheduling problem with carryover sequence dependency Robotics and Computer Integrated Manufacturing, 19, pp. 21-33. http://dx.doi.org/ 10.1016%2FS0736-5845%2802%2900059-5[CROSSREF]http://www.csa.com/htbin/ linkabst.cgi?issn=0736-5845&vol=19&iss=&firstpage=21 [CSA]
95. Logendran, R. and Salmasia, N. and Sriskandarajah, C. (2006) Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups Computers & Operations Research, 33, pp. 158-180. http://dx.doi.org/10.1016%2Fj.cor.2004.07.004 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=33&iss=&firstpage=158 [CSA]
96. Low, C. (1995) Job shop scheduling heuristics for sequence dependent setups Computers & Industrial Engineering, 29(1/4), pp. 279-283. http://dx.doi.org/10.1016%2F0360-8352%2895%2900085-F [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=&vol=29&iss=&firstpage=279 [CSA]
97. Luh, P. and Gou, L. and Zhang, Y. and Nagahora, T. and Tsuji, M. and Yoneda, K. and Hasegawa, T. and Kyoya, Y. and Kano, T. (1998) Job shop scheduling with group-dependent setups, finite buffers and long time horizon Annals of Operations Research: Mathematics of Industrial Systems, 76, pp. 233-259. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=76&iss=&firstpage=233 [CSA]
98. Maimon, O. and Dar-El, E. and Carmon, T. (1993) Set-up saving schemes for printed circuit boards assembly European Journal of Operational Research, 70, pp. 177-190. http://dx.doi.org/ 10.1016%2F0377-2217%2893%2990037-N [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=70&iss=&firstpage=177 [CSA]
99. Mason, S. and Fowler, J. and Carlyle, W. (2002) A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops Journal of Scheduling, 5(3), pp. 247-262. http://dx.doi.org/ 10.1002%2Fjos.102 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=1094-6136&vol=5&iss=3&firstpage=247 [CSA]
100. Mason, S. and Fowler, J. and Carlyle, W. and Montgomery, D. (2005) Heuristics for minimizing total weighted tardiness in complex job shops International Journal of Production Research, 43, pp. 1943-1963. http:// www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=43&iss=&firstpage=1943 [CSA]
101. Maxwell, W. (1964) The scheduling of economic lot sizes Naval Research Logistics Quarterly, 11(2/3), pp. 89-124.http://www.csa.com/htbin/ linkabst.cgi?issn=0028-1441&vol=11&iss=2/3&firstpage=89 [CSA]
102. McGinnis, L. and Ammons, J. and Carlyle, M. and Cranmer, L. and Depuy, G. and Ellis, K. and Tovey, C. and Xu, H. (1992) Automated process planning for printed circuit card assembly IIE Transactions, 24(4), pp. 18-30. http://www.csa.com/htbin/ linkabst.cgi?issn=0740-817X&vol=24&iss=4&firstpage=18 [CSA]
103. Mendes, A. and Müller, F. and França, P. and Moscato, P. (2002) Comparing meta-heuristic approaches for parallel machine scheduling problems Production Planning & Control, 13(2), pp. 143-154. http://dx.doi.org/10.1080%2F09537280110069649 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0953-7287&vol=13&iss=2&firstpage=143 [CSA]
104. Mendez, C. and Henning, G. and Cerde, J. (2001) An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities Computers & Chemical Engineering, 25(4/6), pp. 701-711. http://dx.doi.org/10.1016%2FS0098-1354%2801%2900671-8 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0098-1354&vol=25&iss=4/6&firstpage=701 [CSA]
105. Meyr, H. (2000) Simultaneous lotsizing and scheduling by combining local search with dual reoptimization European Journal of Operational Research, 120(2), pp. 311-326. http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=120&iss=2&firstpage=311 [CSA]
106. Meyr, H. (2002) Simultaneous lotsizing and scheduling on parallel machines European Journal of Operational Research, 139(2), pp. 277-292. http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=139&iss=2&firstpage=277 [CSA]
107. Miller, M. and Chen, H.-C. and Matson, J. and Liu, Q. (1999) A hybrid genetic algorithm for the single machine scheduling problem Journal of Heuristics, 5, pp. 437-454. http://dx.doi.org/ 10.1023%2FA%3A1009684406579 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=1381-1231&vol=5&iss=&firstpage=437 [CSA]
108. Monma, C. and Potts, C. (1989) On the complexity of scheduling with batch setup times Operations Research, 37(5), pp. 798-804. http:// www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=37&iss=5&firstpage=798 [CSA]
109. Moscato, P.(1989) On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech, Pasadena CA:
110. Moscato, P.(1999) Memetic algorithms: A short introduction. In New Ideas in Optimization. (pp. 219-234). London: McGraw-Hill.
111. Norman, B. (1999) Scheduling flowshops with finite buffers and sequence-dependent setup times Computers & Industrial Engineering, 36(1), pp. 163-177. http://dx.doi.org/ 10.1016%2FS0360-8352%2899%2900007-8 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=36&iss=5&firstpage=163 [CSA]
112. Osman, I. and Potts, C. (1989) Simulated annealing for permutation flow-shop scheduling Omega, 17(6), pp. 551-557. http://dx.doi.org/ 10.1016%2F0305-0483%2889%2990059-5 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0030-2228&vol=17&iss=6&firstpage=551 [CSA]
113. Ovacik, I. and Uzsoy, R. (1993) Worst-case error bounds for parallel machines scheduling problems with sequence-dependent setup times Operations Research Letters, 14, pp. 251-256. http://dx.doi.org/ 10.1016%2F0167-6377%2893%2990089-Y [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0167-6377&vol=14&iss=&firstpage=251 [CSA]
114. Ovacik, I. and Uzsoy, R. (1994a) Exploiting shop floor status information to schedule complex job shops Journal of Manufacturing Systems, 13(2), pp. 73-84. http://www.csa.com/htbin/ linkabst.cgi?issn=0278-6125&vol=13&iss=2&firstpage=73 [CSA]
115. Ovacik, I. and Uzsoy, R. (1994b) Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times International Journal of Production Research, 32(6), pp. 1243-1263. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=32&iss=6&firstpage=1243 [CSA]
116. Ovacik, I. and Uzsoy, R. (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times International Journal of Production Research, 33(11), pp. 3173-3192. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=33&iss=11&firstpage=3173 [CSA]
117. Ovacik, I. and Uzsoy, R.(1997) Decomposition Methods for Complex Factory Scheduling Problems. Dordrecht: Kluwer.
118. Ozgur, C. and Brown, J. (1995) A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem Omega, 23(2), pp. 205-219. http://dx.doi.org/10.1016%2F0305-0483%2894%2900057-H [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0030-2228&vol=23&iss=2&firstpage=205 [CSA]
119. Palmer, D. (1965) Sequencing jobs through a multistage process in the minimum total time - a quick method of obtaining a near optimum Operational Research Quarterly, 16(1), pp. 101-107. http://www.csa.com/ htbin/linkabst.cgi?issn=0030-3623&vol=16&iss=1&firstpage=101 [CSA]
120. Papadimitriou, C. and Steiglitz, K.(1998) Combinatorial Optimization: Algorithms and Complexity. New York NY: Mineola.
121. Park, Y. and Kim, S. and Lee, Y. (2000) Scheduling jobs on parallel machines applying neural network and heuristic rules Computers & Industrial Engineering, 38(1), pp. 189-202. http://dx.doi.org/ 10.1016%2FS0360-8352%2800%2900038-3 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=38&iss=1&firstpage=189 [CSA]
122. Parthasarathy, S. and Rajendran, C. (1997a) An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs International Journal of Production Economics, 49(3), pp. 255-263. http://dx.doi.org/ 10.1016%2FS0925-5273%2897%2900017-0 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0925-5273&vol=49&iss=3&firstpage=255 [CSA]
123. Parthasarathy, S. and Rajendran, C. (1997b) A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs -a case study Production Planning & Control, 8(5), pp. 475-483. http://dx.doi.org/ 10.1080%2F095372897235055 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0953-7287&vol=8&iss=5&firstpage=475 [CSA]
124. Pearn, W. and Chung, S. and Chen, A. and Yang, M. (2004) A case study on the multistage IC final testing scheduling problem with reentry International Journal of Production Economics, 88(3), pp. 257-267. http:/ /dx.doi.org/10.1016%2FS0925-5273%2803%2900186-5 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0925-5273&vol=88&iss=3&firstpage=257 [CSA]
125. Pinedo, M.(2002) Scheduling: Theory, Algorithms and Systems, 2nd edn.. Englewood Cliffs NJ: Prentice Hall.
126. Potts, C. and Van Wassenhove, L. (1992) Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity Journal of the Operations Research Society, 43(5), pp. 395-406. http:// dx.doi.org/10.2307%2F2583559 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0453-4514&vol=43&iss=5&firstpage=395 [CSA]
127. Pugazhendhi, S. and Thiagarajan, S. and Rajendran, C. and Anantharaman, N. (2004) Generating non-permutation schedules in flowline-based manufacturing systems with sequence-dependent setup times of jobs: A heuristic approach The International Journal of Advanced Manufacturing Technology, 23(1/2), pp. 64-78. http://dx.doi.org/ 10.1007%2Fs00170-002-1525-6 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0268-3768&vol=23&iss=1/2&firstpage=64 [CSA]
128. Rabadi, G. and Mollaghasemi, M. and Anagnostopoulos, G. (2004) A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time Computers & Operations Research, 31, pp. 1727-1751. http:// dx.doi.org/10.1016%2FS0305-0548%2803%2900117-5 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=31&iss=&firstpage=1727 [CSA]
129. Radhakrishnan, S. and Ventura, J. (2000) Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times International Journal of Production Research, 38(10), pp. 2233-2252. http://dx.doi.org/ 10.1080%2F00207540050028070 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=38&iss=10&firstpage=2233 [CSA]
130. Ragatz, G.(1993). A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times. Proceedings of the 24th Annual Meeting of the Decision Sciences Institute. In [pp. 1375-1377].
131. Rajendran, C. and Ziegler, H. (1997) A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs Computers & Industrial Engineering, 33(1/2), pp. 281-284. http://dx.doi.org/ 10.1016%2FS0360-8352%2897%2900093-4 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=33&iss=10&firstpage=281 [CSA]
132. Rajendran, C. and Ziegler, H. (2003) Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times European Journal of Operational Research, 149(3), pp. 513-522. http://dx.doi.org/ 10.1016%2FS0377-2217%2802%2900485-X [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=149&iss=3&firstpage=513 [CSA]
133. Rajkumar, K. and Narendran, T. (1998) A heuristic for sequencing PCB assembly to minimize setup times Production Planning & Control, 9(5), pp. 465-476. http://dx.doi.org/10.1080%2F095372898233948 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0953-7287&vol=9&iss=5&firstpage=465 [CSA]
134. Raman, N. and Rachamadugu, R. and Talbot, F. (1989) Real time scheduling of an automated manufacturing center European Journal of Operational Research, 40, pp. 222-242. http://dx.doi.org/ 10.1016%2F0377-2217%2889%2990332-9 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=40&iss=&firstpage=222 [CSA]
135. Reeves, C. (1995) A genetic algorithm for flowshop sequencing Computers & Operations Research, 22(1), pp. 5-13. http://dx.doi.org/ 10.1016%2F0305-0548%2893%29E0014-K [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=22&iss=1&firstpage=5 [CSA]
136. Reinelt, G.(1994) The Traveling Salesman: Combinatorial Solutions for TSP Applications. Berlin: Springer-Verlag.
137. Rios-Mercado, R. and Bard, J. (1998a) Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups Computers & Operations Research, 25(5), pp. 351-366. http://dx.doi.org/ 10.1016%2FS0305-0548%2897%2900079-8 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=25&iss=5&firstpage=351 [CSA]
138. Rios-Mercado, R. and Bard, J. (1998b) Heuristics for the flow line problem with setup costs European Journal of Operational Research, 110(1), pp. 76-98. http://dx.doi.org/10.1016%2FS0377-2217%2897%2900213-0 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=110&iss=1&firstpage=76 [CSA]
139. Rios-Mercado, R. and Bard, J. (1999a) A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times IIE Transactions, 31(8), pp. 721-731. http://dx.doi.org/ 10.1023%2FA%3A1007650011043 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0740-817X&vol=31&iss=8&firstpage=721 [CSA]
140. Rios-Mercado, R. and Bard, J. (1999b) An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times Journal of Heuristics, 5(1), pp. 57-74. http://www.csa.com/htbin/ linkabst.cgi?issn=0740-817X&vol=31&iss=8&firstpage=721 [CSA]
141. Roslöf, J. and Harjunkoski, I. and Westerlund, T. and Isaksson, J. (2002) Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure European Journal of Operational Research, 138, pp. 29-42. http://dx.doi.org/ 10.1016%2FS0377-2217%2801%2900140-0 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=138&iss=&firstpage=29 [CSA]
142. Rossetti, M. and Stanford, K. (2003) Group sequencing a PCB assembly system via an expected sequence dependent setup heuristic Computers & Industrial Engineering, 45(1), pp. 231-254. http://dx.doi.org/ 10.1016%2FS0360-8352%2803%2900043-3 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=45&iss=&firstpage=231 [CSA]
143. Roy, B. and Sussman, B. (1964) Les problèmes d'ordonnancement avec contraintes disjonctives SEMA, pp. 9. Note D.S.http://www.csa.com/ htbin/linkabst.cgi?issn=0167-2134&vol=&iss=&firstpage=9 [CSA]
144. Rubin, P. and Ragatz, G. (1995) Scheduling in a sequence dependent setup environment with genetic search Computers & Operations Research, 22(1), pp. 85-99. http://dx.doi.org/10.1016%2F0305-0548%2893%29E0021-K [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=22&iss=1&firstpage=85 [CSA]
145. Ruiz, R. and Maroto, C. (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility European Journal of Operational Research, 169, pp. 781-800. http://dx.doi.org/ 10.1016%2Fj.ejor.2004.06.038 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=169&iss=&firstpage=781 [CSA]
146. Ruiz, R. and Maroto, C. and Alcaraz, J. (2005) Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics European Journal of Operational Research, 165, pp. 34-54. http://dx.doi.org/10.1016%2Fj.ejor.2004.01.022 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=165&iss=&firstpage=34 [CSA]
147. Salomon, M. and Solomon, L. and Van Wassenhove, L. and Dumas, J. and Dauzere-Peres, S. (1997) Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the traveling salesman problem with time windows European Journal of Operational Research, 100, pp. 494-513. http://dx.doi.org/ 10.1016%2FS0377-2217%2896%2900020-3 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=100&iss=&firstpage=494 [CSA]
148. Schaller, J. and Gupta, J. and Vakharia, A. (2000) Scheduling a flowline manufacturing cell with sequence dependent family setup times European Journal of Operational Research, 125(2), pp. 324-339. http://dx.doi.org/ 10.1016%2FS0377-2217%2899%2900387-2 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=125&iss=2&firstpage=324 [CSA]
149. Schutten, J. (1996) List scheduling revisited Operations Research Letters, 18(4), pp. 167-170. http://dx.doi.org/ 10.1016%2F0167-6377%2895%2900057-7 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0167-6377&vol=18&iss=4&firstpage=167 [CSA]
150. Shailendra, J. and Eric, J. and Fereydoon, S. (1996) Implementing setup optimization on the shop floor Operations Research, 44(6), pp. 843-851. http://www.csa.com/htbin/ linkabst.cgi?issn=0030-364X&vol=44&iss=6&firstpage=843 [CSA]
151. Sikora, R. (1996) A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line Computers & Industrial Engineering, 30(4), pp. 969-981. http://dx.doi.org/ 10.1016%2F0360-8352%2896%2900046-0 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=30&iss=6&firstpage=969 [CSA]
152. Sikora, R. and Chhajed, D. and Shaw, M. (1996) Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line Computers & Industrial Engineering, 30(4), pp. 659-679. http:// dx.doi.org/10.1016%2F0360-8352%2896%2900183-0 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=&vol=30&iss=6&firstpage=659 [CSA]
153. Silver, E. and Meal, H. (1973) A heuristic selecting lot size requirement for the case of a deterministic time varying demand rate and discrete opportunities for replenishment Production and Inventory Management, 14, pp. 64-74. http://www.csa.com/htbin/ linkabst.cgi?issn=0897-8336&vol=14&iss=&firstpage=64 [CSA]
154. Simons, J., Jr. (1992) Heuristics in flow shop scheduling with sequence dependent setup times Omega, 20(2), pp. 215-225. http://dx.doi.org/ 10.1016%2F0305-0483%2892%2990075-I [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0030-2228&vol=20&iss=2&firstpage=215 [CSA]
155. Sivrikaya-Serifoglu, F. and Ulusoy, G. (1999) Parallel machine scheduling with earliness and tardiness penalties Computers & Operations Research, 26(8), pp. 773-787. http://dx.doi.org/ 10.1016%2FS0305-0548%2898%2900090-2 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=26&iss=8&firstpage=773 [CSA]
156. Spina, R. and Galantucci, L. and Dassisti, M. (2003) A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time Computers & Industrial Engineering, 45(4), pp. 573-583. http://dx.doi.org/10.1016%2FS0360-8352%2803%2900075-5 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=45&iss=8&firstpage=573 [CSA]
157. Srikar, B. and Ghosh, S. (1986) A MILP model for the n-job, M-stage flowshop, with sequence dependent setup times International Journal of Production Research, 24(6), pp. 1459-1472. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=24&iss=6&firstpage=1459 [CSA]
158. Stafford, E., Jr. and Tseng, F. (1990) On the Sriker-Ghosh MILP model for the N × M SDST flowshop problem International Journal of Production Research, 28(10), pp. 1817-1830. http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7543&vol=28&iss=10&firstpage=1817 [CSA]
159. Stafford, E., Jr. and Tseng, F. (2002) Two models for a family of flowshop sequencing problems European Journal of Operational Research, 142(2), pp. 282-293. http://dx.doi.org/ 10.1016%2FS0377-2217%2801%2900320-4 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=142&iss=2&firstpage=282 [CSA]
160. Stutzle, T.(1998) Applying iterated local search to the permutation flow shop problem. Darmstadt: FG Intellektik, TU Darmstadt.
161. Sun, J. and Hwang, H. (2001) Scheduling problem in a two-machine flow line with the N-step prior-job-dependent set-up times International Journal of Systems Science, 32(3), pp. 375-385. http://dx.doi.org/ 10.1080%2F002077201300029764 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0020-7721&vol=32&iss=3&firstpage=375 [CSA]
162. Sun, J. and Yee, S. and Hwang, H. (2003) Job shop scheduling with sequence dependent setup times to minimize makespan International Journal of Industrial Engineering - Theory Applications and Practice, 10(4), pp. 455-461. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=10&iss=3&firstpage=455 [CSA]
163. Sun, X. and Noble, J. and Klein, C. (1999) Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness IIE Transactions, 31(2), pp. 113-124. http://dx.doi.org/ 10.1023%2FA%3A1007508400656[CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0740-817X&vol=31&iss=2&firstpage=113 [CSA]
164. Taillard, E. (1993) Benchmarks for basic scheduling problems European Journal of Operational Research, 64, pp. 278-285. http://www.csa.com/ htbin/linkabst.cgi?issn=0377-2217&vol=64&iss=&firstpage=278 [CSA]
165. Tan, K. and Narasimhan, R. (1997a) Minimizing tardiness on a single processor with sequence-dependent setup times: A simulated annealing approach Omega, 25(6), pp. 619-634. http://www.csa.com/htbin/ linkabst.cgi?issn=0030-2228&vol=25&iss=6&firstpage=619 [CSA]
166. Tan, K. and Narasimhan, R. (1997b) Multi-objective sequencing with sequence dependent setup times International Journal of Operations and Quantitative Management, 3, pp. 69-84. http://www.csa.com/htbin/ linkabst.cgi?issn=1082-1910&vol=3&iss=&firstpage=69 [CSA]
167. Tan, K. and Narasimhan, R. and Rubin, P. and Ragatz, G. (2000) A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times Omega, 28(3), pp. 313-326. http://dx.doi.org/10.1016%2FS0305-0483%2899%2900050-X [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0030-2228&vol=28&iss=3&firstpage=313 [CSA]
168. Thizy, J. and Van Wassenhove, L. (1985) Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation IIE Transactions, 17(4), pp. 308-313. http://www.csa.com/htbin/ linkabst.cgi?issn=0740-817X&vol=17&iss=4&firstpage=308 [CSA]
169. Trigeiro, W. and Thomas, L. and McClain, J. (1989) Capacitated lot sizing with setup times Management Science, 35(3), pp. 353-366. http:// www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=35&iss=3&firstpage=353 [CSA]
170. Unal, A. and Uzsoy, R. and Kiran, A. (1997) Rescheduling on a single machine with part-type dependent setup times and deadlines Annuals of Operations Research, 70, pp. 93-113. http://dx.doi.org/ 10.1023%2FA%3A1018955111939 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=70&iss=3&firstpage=93 [CSA]
171. Uzsoy, R. and Lee, C. and Martin-Vega, L. (1992) Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine Naval Research Logistics, 39, pp. 369-388. http://www.csa.com/htbin/ linkabst.cgi?issn=0028-1441&vol=39&iss=&firstpage=369 [CSA]
172. Uzsoy, R. and Martin-Vega, L. and Lee, C. and Leonard, P. (1991) Production scheduling algorithms for a semiconductor testing facility IEEE Transactions on Semiconductor Manufacturing, 4, pp. 270-280. http:// dx.doi.org/10.1109%2F66.97809 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0894-6507&vol=4&iss=&firstpage=270 [CSA]
173. Vallada, E. and Ruiz, R. and Maroto, C.(2003) Synthetic and real benchmarks for complex flow-shop problems. Valencia Spain: Grupo de Investigatión Operativa GIO, Universidad Politécnica de Valencia. Technical report,
174. Wagner, B. and Davis, D. (2002) A search heuristic for the sequence-dependent economic lot scheduling problem European Journal of Operational Research, 141(1), pp. 133-146. http://dx.doi.org/ 10.1016%2FS0377-2217%2801%2900265-X [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=141&iss=1&firstpage=133 [CSA]
175. Weng, M. and Lu, J. and Ren, H. (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective International Journal of Production Economics, 70(3), pp. 215-226. http://dx.doi.org/10.1016%2FS0925-5273%2800%2900066-9 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0925-5273&vol=70&iss=3&firstpage=215 [CSA]
176. Widmer, M. and Hertz, A. (1989) A new heuristic method for the flow shop sequencing problem European Journal of Operational Research, 41, pp. 186-193. http://dx.doi.org/10.1016%2F0377-2217%2889%2990383-4 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=41&iss=&firstpage=186 [CSA]
177. Wilbrecht, J. and Prescott, W. (1969) The influence of set-up time on job shop performance Management Science, 16, pp. B274-B280. http:// www.csa.com/htbin/ linkabst.cgi?issn=0025-1909&vol=16&iss=&firstpage=B274 [CSA]
178. Wilhelm, W. and Tarmy, P. (2003) Circuit card assembly on tandem turret-type placement machines IIE Transactions, 35, pp. 627-645. http:// dx.doi.org/10.1080%2F07408170304357 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0740-817X&vol=35&iss=&firstpage=627 [CSA]
179. Woodruff, D. and Spearman, M. (1992) Sequencing and batching for two classes of job with deadlines and setup times Production and Operations Management, 1, pp. 87-102. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=1&iss=&firstpage=87 [CSA]
180. Yalaoui, F. and Chu, C. (2003) An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times IIE Transactions, 35, pp. 183-190. http://dx.doi.org/ 10.1080%2F07408170304382 [CROSSREF] http://www.csa.com/htbin/ linkabst.cgi?issn=0740-817X&vol=35&iss=&firstpage=183 [CSA]
181. Yang, W. and Liao, C. (1999) Survey of scheduling research involving setup times International Journal of Systems Science, 30(2), pp. 143-155. http://dx.doi.org/10.1080%2F002077299292498 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0020-7721&vol=30&iss=2&firstpage=143 [CSA]
182. Zoghby, J. and Barnes, J. and Hasenbein, J. (2005) Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches European Journal of Operational Research, 167, pp. 336-348. http://dx.doi.org/10.1016%2Fj.ejor.2004.03.027 [CROSSREF] http:// www.csa.com/htbin/ linkabst.cgi?issn=0377-2217&vol=167&iss=&firstpage=336 [CSA]