Dantzig-Wolfe Decomposition for Job Shop Scheduling

Sylvie Gélinas () and François Soumis ()
Additional contact information
Sylvie Gélinas: École Polytechnique and GERAD
François Soumis: École Polytechnique and GERAD

Chapter Chapter 10 in Column Generation, 2005, pp 271-302 from Springer

Abstract: Abstract This chapter presents a formulation for the job shop problem based on Dantzig-Wolfe decomposition with a subproblem for each machine. Each subproblem is a sequencing problem on a single machine with time windows. The formulation is used within an exact algorithm capable of solving problems with objectives C max, T max, as well as an objective consistent with the Just-In-Time principle. This objective involves an irregular cost function of operation completion times. Numerical results are presented for 2 to 10 machine problems involving up to 500 operations.

Keywords: Schedule Problem; Completion Time; Single Machine; Column Generation; Precedence Constraint (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (2)

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-0-387-25486-9_10

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

DOI: 10.1007/0-387-25486-2_10

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 ().