journal article
Open Access
Aug 01, 2017
Changeover formulations for discrete-time mixed-integer programming scheduling models
Topics
No keywords indexed for this article. Browse by subject →
References
38
[1]
Artigues "A branch and bound method for the job-shop problem with sequence-dependent setup times" Annals of Operations Research (2008) 10.1007/s10479-007-0283-0
[2]
Avalos-Rosales "A reformulation for the problem of scheduling unrelated parallel machines with sequence and machine dependent setup times" (2013)
[3]
Baptiste "A branch and bound to minimize the number of late jobs on a single machine with release time constraints" European Journal of Operational Research (2003) 10.1016/s0377-2217(01)00353-8
[4]
Brucker "A branch & bound method for the general-shop problem with sequence dependent setup-times" Operation Research Spektrum (1996) 10.1007/bf01539706
[5]
Chandra "A binary branch and bound algorithm to minimize maximum scheduling cost" Omega-International Journal of Management Science (2014) 10.1016/j.omega.2013.02.005
[6]
Coban "Single-facility scheduling by logic-based Benders decomposition" Annals of Operations Research (2013) 10.1007/s10479-011-1031-z
[7]
Harjunkoski "Scope for industrial applications of production scheduling models and solution methods" Computers & Chemical Engineering (2014) 10.1016/j.compchemeng.2013.12.001
[8]
Hooker (2007)
[9]
Hooker "Planning and scheduling by logic-based benders decomposition" Operations Research (2007) 10.1287/opre.1060.0371
[10]
IBM, I. L. O.G. (2015). IBM ILOG CPLEX Optimization Studio V12.6.3 documentation.
[11]
Jain "Algorithms for hybrid MILP/CP models for a class of optimization problems" INFORMS Journal on Computing (2001) 10.1287/ijoc.13.4.258.9733
[12]
Karmarkar "The deterministic dynamic product cycling problem" Operations Research (1985) 10.1287/opre.33.2.326
[13]
Kelly "An improved MILP modeling of sequence-dependent switchovers for discrete-time scheduling problems" Industrial & Engineering Chemistry Research (2007) 10.1021/ie061572g
[14]
Kondili "A general algorithm for short-term scheduling of batch-operations. I. Milp formulation" Computers & Chemical Engineering (1993) 10.1016/0098-1354(93)80015-f
[15]
Kopanos "MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: A benchmark scheduling problem of the pharmaceutical industry" European Journal of Operational Reaserch (2010) 10.1016/j.ejor.2010.06.002
[16]
Maravelias "A hybrid MILP/CP decomposition approach for the continous time scheduling of multipurpose batch plants" Computers & Chemical Engineering (2004) 10.1016/j.compchemeng.2004.03.016
[17]
Maravelias "A decomposition framework for the scheduling of single- and multi-stage processes" Computers & Chemical Engineering (2006) 10.1016/j.compchemeng.2005.09.011
[18]
Maravelias "General framework and modeling approach classification for chemical production scheduling" AIChE Journal (2012) 10.1002/aic.13801
[19]
Méndez "State-of-the-art review of optimization methods for short-term scheduling of batch processes" Computers & Chemical Engineering (2006) 10.1016/j.compchemeng.2006.02.008
[20]
Merchan "Discrete-time mixed-integer programming models and solution methods for production scheduling in multistage facilities" Computers & Chemical Engineering (2016) 10.1016/j.compchemeng.2016.04.034
[21]
Moniz "New general discrete-time scheduling model for multipurpose batch plants" Industrial & Engineering Chemistry Research (2013) 10.1021/ie4021073
[22]
Novara "A novel constraint programming model for large-scale scheduling problems in multiproduct multistage batch plants: Limited resources and campaign-based operation" Computers & Chemical Engineering (2016) 10.1016/j.compchemeng.2016.04.030
[23]
Sadykov "Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates" INFORMS Journal on Computing (2006) 10.1287/ijoc.1040.0110
[24]
Sahinidis "MINLP model for cyclic multiproduct scheduling on continuous parallel lines" Computers & Chemical Engineering (1991) 10.1016/0098-1354(91)87008-w
[25]
Shah "A general algorithm for short-term scheduling of batch operations. II. Computational issues" Computers & Chemical Engineering (1993) 10.1016/0098-1354(93)80016-g
[26]
Sousa "A time indexed formulation of non-preemptive single machine scheduling problems" Mathematical Programming (1992) 10.1007/bf01586059
[27]
Sundaramoorthy "Computational study of network-based mixed-integer programming approaches for chemical production scheduling" Industrial & Engineering Chemistry Research (2011) 10.1021/ie101419z
[28]
A general framework for process scheduling
Arul Sundaramoorthy, Christos T. Maravelias
AIChE Journal
2011
10.1002/aic.12300
[29]
Tran "Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups" (2012)
[30]
van den Akker "Time-indexed formulations for machine scheduling problems: Column generation" INFORMS Journal on Computing (2000) 10.1287/ijoc.12.2.111.11896
[31]
van den Akker "A polyhedral approach to single-machine scheduling problems" Mathematical Programming (1999) 10.1007/s10107990047a
[32]
Velez "Mixed-integer programming model and tightening methods for scheduling in general chemical production environments" Industrial & Engineering Chemistry Research (2013) 10.1021/ie302741b
[33]
Wolsey "Valid Inequalities for 0-1 knapsacks and mips with generalised upper bound constraints" Discrete Applied Mathematics (1990) 10.1016/0166-218x(90)90148-6
[34]
Wolsey "MIP modelling of changeovers in production planning and scheduling problems" European Journal of Operational Research (1997) 10.1016/s0377-2217(97)89646-4
[35]
Wolsey (1998)
[36]
Zeballos "A CP formulation for scheduling multiproduct multistage batch plants" Computers & Chemical Engineering (2011) 10.1016/j.compchemeng.2011.01.043
[37]
Zentner "Practical considerations in using model-based optimization for the scheduling and planning of batch/semicontinuous processes" Journal of Process Control (1994) 10.1016/0959-1524(94)80046-4
[38]
Zyngier "Multi-product inventory logistics modeling in the process industries" (2009)
Metrics
28
Citations
38
References
Details
- Published
- Aug 01, 2017
- Vol/Issue
- 260(3)
- Pages
- 949-963
- License
- View
Authors
Funding
National Science Foundation
Award: CBET-1066206
Cite This Article
Sara Velez, Yachao Dong, Christos T. Maravelias (2017). Changeover formulations for discrete-time mixed-integer programming scheduling models. European Journal of Operational Research, 260(3), 949-963. https://doi.org/10.1016/j.ejor.2017.01.004
Related
You May Also Like
Compromise solution by MCDM methods: A comparative analysis of VIKOR and TOPSIS
Serafim Opricovic, Gwo-Hshiung Tzeng · 2004
3,817 citations
Analytic hierarchy process: An overview of applications
Omkarprasad S. Vaidya, Sushil Kumar · 2006
2,653 citations