Title :
The capacitated production planning problem with sequence-dependent changeovers
Author :
Li, Shaorui ; Kubo, Mikio
Author_Institution :
Sch. of Bus. Adm., Southwestern Univ. of Finance & Econ., Chengdu
Abstract :
This paper addresses the multi-machine multi-item capacitated production planning problem with sequence-dependent changeovers that faced by most process industries. A new mixed-integer programming model formulation and its incorporation into a fix-and-relax heuristic are proposed. Numerical studies from test instances of different size exhibit that the developed heuristic approach is capable of solving large instances within a reasonable amount of time and indicate superior solution qualities.
Keywords :
computational complexity; integer programming; lot sizing; process planning; production planning; sequences; Production lot-sizing; computational complexity; fix-and-relax heuristics approach; mixed-integer programming model formulation; multi machine multi item capacitated production planning problem; process industry; sequence-dependent changeover; fix-and-relax; lot sizing and scheduling; production planning; strong formulation;
Conference_Titel :
Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2012-4
Electronic_ISBN :
978-1-4244-2013-1
DOI :
10.1109/SOLI.2008.4682931
