Skip to main content
Top

2013 | OriginalPaper | Chapter

83. Job Shop Scheduling with Sequence-Dependent Setup Times Based on Constraint Programming Approach

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Job shop scheduling problem with sequence-dependent setup times is complicated because machines have to be reconfigured between two consecutive operations. More researchers have attracted attention to this problem. We propose a constraint programming approach to minimize the makespan. Three branching strategies including binary constraint heuristic, variable-based heuristic, task-based heuristic are compared. The constraint model and search strategies are carried out by Xpress-MP. The results showed that binary constraint heuristic is more effective.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
go back to reference Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Op Res 187:985–1032CrossRef Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Op Res 187:985–1032CrossRef
go back to reference Artigues C, Feillet D (2008) A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann Op Res 159:135–159CrossRef Artigues C, Feillet D (2008) A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann Op Res 159:135–159CrossRef
go back to reference Balas E, Simonetti N, Vazacopoulos A (2008) Job shop scheduling with setup times, deadlines and precedence constraints. J Sched 11:253–262CrossRef Balas E, Simonetti N, Vazacopoulos A (2008) Job shop scheduling with setup times, deadlines and precedence constraints. J Sched 11:253–262CrossRef
go back to reference Ballicu M, Giua A, Seatzu C (2002) Job-shop scheduling models with set-up times. Proc IEEE Int Conf Syst, Man Cybern 5:95–100 Ballicu M, Giua A, Seatzu C (2002) Job-shop scheduling models with set-up times. Proc IEEE Int Conf Syst, Man Cybern 5:95–100
go back to reference Chen YR, Guan ZL, Peng YF, Shao XY, Hassea M (2010) Technology and system of constraint programming for industry production scheduling – part I: a brief survey and potential directions. Front Mech Eng China 5(4):455–464CrossRef Chen YR, Guan ZL, Peng YF, Shao XY, Hassea M (2010) Technology and system of constraint programming for industry production scheduling – part I: a brief survey and potential directions. Front Mech Eng China 5(4):455–464CrossRef
go back to reference Cheung W, Zhou H (2001) Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Ann Op Res 107:65–81CrossRef Cheung W, Zhou H (2001) Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Ann Op Res 107:65–81CrossRef
go back to reference Chio IC, Chio DS (2002) A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups. Comput Ind Eng 42:43–58CrossRef Chio IC, Chio DS (2002) A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups. Comput Ind Eng 42:43–58CrossRef
go back to reference Grimes D, Hebrard E (2010) Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach. CPAIOR, LNCS 6120:147–161 Grimes D, Hebrard E (2010) Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach. CPAIOR, LNCS 6120:147–161
go back to reference Jain AS, Meeran S (1999) Deterministic job-shop scheduling: past, present and future. Eur J Op Res 113(2):390–434CrossRef Jain AS, Meeran S (1999) Deterministic job-shop scheduling: past, present and future. Eur J Op Res 113(2):390–434CrossRef
go back to reference Rossi F, van Beek P, Walsh T (2006) Handbook of constraint programming. Elsevier, Boston/Amsterdam Rossi F, van Beek P, Walsh T (2006) Handbook of constraint programming. Elsevier, Boston/Amsterdam
Metadata
Title
Job Shop Scheduling with Sequence-Dependent Setup Times Based on Constraint Programming Approach
Author
Yun-fang Peng
Copyright Year
2013
Publisher
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-33012-4_83