Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries

被引:25
作者
Camargo, V. C. B. [1 ,2 ]
Toledo, F. M. B. [1 ]
Almada-Lobo, B. [2 ]
机构
[1] Univ Sao Paulo, Inst Ciencias Matemat & Comp, BR-13560970 Sao Carlos, SP, Brazil
[2] Univ Porto, P-4100 Oporto, Portugal
基金
巴西圣保罗研究基金会;
关键词
lot sizing and scheduling; two-stage production system; mixed-integer program; time scale; EXTENSIONS;
D O I
10.1057/jors.2011.159
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we propose three novel mathematical models for the two-stage lot-sizing and scheduling problems present in many process industries. The problem shares a continuous or quasi-continuous production feature upstream and a discrete manufacturing feature downstream, which must be synchronized. Different time-based scale representations are discussed. The first formulation encompasses a discrete-time representation. The second one is a hybrid continuous-discrete model. The last formulation is based on a continuous-time model representation. Computational tests with state-of-the-art MIP solver show that the discrete-time representation provides better feasible solutions in short running time. On the other hand, the hybrid model achieves better solutions for longer computational times and was able to prove optimality more often. The continuous-type model is the most flexible of the three for incorporating additional operational requirements, at a cost of having the worst computational performance. Journal of the Operational Research Society (2012) 63, 1613-1630. doi:10.1057/jors.2011.159 published online 7 March 2012
引用
收藏
页码:1613 / 1630
页数:18
相关论文
共 21 条
[11]   Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review [J].
Floudas, CA ;
Lin, XX .
COMPUTERS & CHEMICAL ENGINEERING, 2004, 28 (11) :2109-2129
[12]   Capacitated lot-sizing with sequence dependent setup costs [J].
Haase, K .
OR SPEKTRUM, 1996, 18 (01) :51-59
[13]   Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints [J].
Jans, Raf .
INFORMS JOURNAL ON COMPUTING, 2009, 21 (01) :123-136
[14]   Discrete lotsizing and scheduling by batch sequencing [J].
Jordan, C ;
Drexl, A .
MANAGEMENT SCIENCE, 1998, 44 (05) :698-713
[15]   Planning and scheduling of parallel semicontinuous processes .2. Short-term scheduling [J].
Karimi, IA ;
McDonald, CM .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 1997, 36 (07) :2701-2714
[16]   THE DETERMINISTIC DYNAMIC PRODUCT CYCLING PROBLEM [J].
KARMARKAR, US ;
SCHRAGE, L .
OPERATIONS RESEARCH, 1985, 33 (02) :326-345
[17]   Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum [J].
Kim, Seong-in ;
Han, Junghee ;
Lee, Youngho ;
Park, Eunkyung .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (02) :302-314
[18]   Simultaneous lotsizing and scheduling by combining local search with dual reoptimization [J].
Meyr, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) :311-326
[19]   Simultaneous lotsizing and scheduling on parallel machines [J].
Meyr, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (02) :277-292
[20]  
Suerie C., 2005, Time continuity in discrete time models: new approaches for production planning in process industries. Publications of darmstadt technical university