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 Cmax, Tmax, 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. © 2005 Springer Science+Business Media, Inc.
CITATION STYLE
Gélinas, S., & Soumis, F. (2005). Dantzig-Wolfe decomposition for job shop scheduling. In Column Generation (pp. 271–302). Springer US. https://doi.org/10.1007/0-387-25486-2_10
Mendeley helps you to discover research relevant for your work.