Machine scheduling with sequence-dependent setup times using a randomizedsearch heuristic

2009 International Conference on Computers and Industrial Engineering, CIE 2009

Volumn , Issue , 2009, Pages 28-33

  Jairo, R Montoya Torres ^a   Milton, Soto Ferrari ^b   Fernando, González Solano ^b   Edgar, H Alfonso Lizarazo ^a  

^a UNIVERSIDAD DE LA SABANA   (Colombia)

^b UNIVERSIDAD DEL NORTE   (Colombia)

Author keywords

Heuristic; Parallel machines; Scheduling; Setup times; Single machine

Indexed keywords

COMPLETION TIME; COMPUTATIONAL TIME; EXECUTION SEQUENCES; HEURISTIC; IDENTICAL PARALLEL MACHINES; MACHINE SCHEDULING; MAKESPAN; OPTIMAL SOLUTIONS; PARALLEL MACHINE; SEQUENCE-DEPENDENT SETUP TIME; SETUP TIMES; SINGLE MACHINES; STRONGLY NP-HARD;

BUSINESS MACHINES; SCHEDULING ALGORITHMS;

INDUSTRIAL ENGINEERING;

EID: 77956122302     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. Abdekhodaee, A.H., A. Wirth, "Scheduling parallel machines with asingle server: some solvable cases and heuristics", Computers andOperations Research, Vol.29, pp. 295-315, 2002.
2. Abdekhodaee, A.H., A. Wirth, H.S. Gan, "Equal processing and equalsetup time cases of scheduling parallel machines with a single server",Computers and Operations Research, Vol.31, pp. 1867-1889, 2004.
3. Allahverdi, A., J.N.D. Gupta, T. Aldowaisan, "A review of schedulingresearch involving setup considerations", Omega The International Journalof Management Science, Vol.27, pp. 219-239, 1999.
4. Allahverdi, A., C.T. Ng, T.C.E. Cheng, M.Y. Kovalyov, "A survey ofscheduling problems with setup times or costs", European Journal ofOperational Research, Vol.187, pp. 985-1032, 2008.
5. Allahverdi, A., H.M. Soroush, "The significance of reducing setuptimes/setup costs", European Journal of Operational Research, Vol.187, pp.978-984, 2008.
6. Armentano, V.A., R. Mazzini, "A genetic algorithm for scheduling ona single machine with with setup and due dates", Production Planning andControl, Vol.11, pp. 713-720, 2000.
7. Barnes, J.W., L.K. Vanston, "Scheduling jobs with linear delaypenalties and sequence dependent setup times and release dates", OperationsResearch, Vol.29, pp. 146-154, 1981.
8. Bilge, U., F. Kirac, M. Kurtulan, P. Pekgun, "A tabu searchalgorithm for parallel machine total tardiness problem", Computers andOperations Research, Vol.31, pp. 397-414, 2004.
9. Bianco, L., S. Ricciardelli, G. Rinaldi, A. Sassano, " Schedulingtasks with sequence-dependent processing times", Naval Research Logistics,Vol.35, pp. 177-184, 1988.
10. Chang, T.Y., ED. Chou, C.E. Lee, "A heuristic algorithm to minimizetotal weighted tardiness on a single machine with release dates andsequence-dependent setup times", Journal of the Chinese Institute ofIndustrial Engineers, Vol.21, pp. 289-300, 2004.
11. Chu, C., "Efficient heuristics to minimize total flow time withrelease dates", Operations Research Letters, Vol.12, pp. 321-330, 2003.
12. Flynn, B.B., "The effects of setup time on output capacity incellular manufacturing", International Journal of Production Research,Vol.25, pp. 1761-1772, 1987.
13. França, P.M., A. Mendes, P. Moscato, "A memetic algorithm forthe total tardiness single machine scheduling problem", European Journalof Operational Research, Vol.132, pp. 224-242, 2001.
14. Gagne, C., W.L. Price, M. Gravel, "Comparing an ACO algorithm withother heuristics for the single machine scheduling problem withsequence-dependent setup times", Journal of the Operational ResearchSociety, Vol.53, pp. 895-906, 2002.
15. Gilmore, P.C., R.E. Gomory, "Sequencing a one-state variablemachine: a solvable case of the traveling salesman problem", OperationsResearch, Vol.12, pp. 655-679, 1964.
16. Guinet, A., "Scheduling sequence-dependent jobs on identicalparallel machines to miniize completion time criteria", InternationalJournal of Production Research, Vol.31, pp. 1579-1594, 1993.
17. He, W., A. Kusiak, "Scheduling manufacturing systems",Computers in Industry, Vol.20, pp. 163-175, 1992.
18. Kogan, K., E. Levner, "A polynomial algorithm for schedulingsmall-scale manufacturing cells served by multiple robots", Computers andOperations Research, Vol.25, pp. 53-62, 1998.
19. Krajewski, L.J., B.E. King, L.P. Ritzman, D.S. Wong, "Kanban, MRPand shaping the manufacturing environment", Management Science, Vol.33, pp.39-57, 1987.
20. Kurz, M.E., R.G. Askin, "Heuristic scheduling of parallel machineswith sequence-dependent set-up times", International Journal of ProductionResearch, Vol.39, pp. 3747-3769, 2001.
21. Liu, C.Y., S.C. Chang, "Scheduling flexible flow shops withsequence-dependent setup effects", IEEE Transactions on Robotics andAutomation, Vol.16, pp. 408-419, 2000.
22. McNaughton, R., "Scheduling with deadlines and loss functions".Management Science, 6, 1-12, 1959.
23. i problem", Computers and Operations Research, Vol.34, pp. 2840-2848, 2007.
24. Ozgur, CO., J.R. Brown, "A two-stage traveling salesman procedurefor the single machine sequence-dependent scheduling problem", Omega TheInternational Journal of Management Science, Vol.23, pp. 205-219, 1995.
25. Pfund, M., J.W. Fowler, A. Gadkari, Y. Chen, "Scheduling jobs onparallel machines with setup times and ready times", Computers andIndustrial Engineering, Vol.54, pp. 764-782, 2008.
26. Pinedo, M., "Scheduling: Theory, Algorithms, and Systems".Springer. Third Edition. 2008.
27. Presby, J.T., M.L. Wolfson, "An algorithm for solving job sequencingproblems", Management Science, Vol.13, pp. B454-B464, 1967.
28. Sivrikaya-Serifoglu, F, G. Ulusoy, "Parallel machine scheduling withearliness and tardiness penalties", Computers and Operations Research,Vol.26, pp. 773-787, 1999.
29. Tan, K.C., R. Narasimhan, "Minimizing tardiness on a singleprocessor with sequence-dependent setup times", Omega The InternationalJournal of Management Science, Vol.25, pp. 619-634, 1997.
30. Tan, K.C., R. Narasimhan, PA. Rubin, G.L. Ragatz, "A comparison offour methods for minimizing total tardiness on a single processor with sequencedependent setup times", Omega The International Journal of ManagementScience, Vol.28, pp. 313-326, 2000.
31. Trovinger, S.C., R.E. Bohn, "Setup time reduction for electronicsassembly: Combining simple (SMED) and IT-based methods", Production andOperations Management, Vol.14, pp. 205-217, 2005.
32. Uzsoy, R., C.Y. Lee, L.A. Martin-Vega, "Scheduling semiconductortest operations: Minimizing maximum lateness and number of tardy jobs on asingle machine", Naval Research Logistics, Vol.39, pp. 369-388, 1992.
33. Uzsoy, R., L.A. Martin-Vega, C.Y. Lee, PA. Leonard, " Productionscheduling algorithms for a semiconductor testing facility", IEEETransactions on Semiconductor Manufacturing, Vol.4, pp. 270-280, 1991.
34. Wang, J.B., "Single-machine scheduling with past-sequence- dependentsetup times and time-dependent learning effect", Computers and IndustrialEngineering, Vol.55, pp. 584-591, 2008.
35. Webster, S., M. Azizoglu, "Dynamic programming algorithms forscheduling parallel machines with family setup times", Computers andOperations Research, Vol.28, pp. 127-137, 2001.
36. Zhu, X., W.E. Wilhelm, "Scheduling and lot sizing withsequence-dependent setup: A literature review", IIE Transactions, Vol.38,pp. 987-1007, 2006.