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

Yun-fang Peng ()
Additional contact information
Yun-fang Peng: Shang hai University

Chapter Chapter 83 in Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012), 2013, pp 835-841 from Springer

Abstract: 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.

Keywords: Job shop scheduling; Setup time; Constraint programming (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-33012-4_83

Ordering information: This item can be ordered from
http://www.springer.com/9783642330124

DOI: 10.1007/978-3-642-33012-4_83

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().