Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Queyranne, Andreas Schulz (2008)
Polyhedral Approaches to Machine Scheduling
Louis-Philippe Bigras, M. Gamache, G. Savard (2005)
Time-Indexed Formulations and the Total Weighted Tardiness ProblemINFORMS J. Comput., 20
J. Akker, H. Hoogeveen, S. Velde (1999)
Parallel Machine Scheduling by Column GenerationOper. Res., 47
G Matibevic (2008)
37Strojniški vestnik - J Mech Eng, 54
Francisco Ballestín, F. Mallor, P. Mateo (2011)
Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithmOptimization and Engineering, 13
Yunpeng Pan, Zhe Liang (2017)
Dual relaxations of the time-indexed ILP formulation for min–sum scheduling problemsAnnals of Operations Research, 249
M. Akker, C. Hurkens, M. Savelsbergh (2000)
Time-Indexed Formulations for Machine Scheduling Problems: Column GenerationINFORMS J. Comput., 12
Z-L Chen (1999)
220Eur J Oper Res, 116
G Matibevic, N Majdandzic, T Lovrc (2008)
Production scheduling model in aluminium foundryStrojniški vestnik - J Mech Eng, 54
SK Gauri (2009)
189Prod Eng Res Devel, 3
S. Dauzére-Pérés (1995)
Minimizing late jobs in the general one machine scheduling problemEuropean Journal of Operational Research, 81
B Detienne (2011)
523J Sched, 14
Boris Detienne, S. Dauzére-Pérés, C. Yugma (2011)
Scheduling jobs on parallel machines to minimize a regular step total cost functionJournal of Scheduling, 14
C Artigues (2017)
154Oper Res Lett, 45
A Obeid, S Dauzère-Pérès, C Yugma (2014)
Scheduling job families on non-identical parallel machines with time constraintsAnn Oper Res, 213
E Hans (2011)
2481Int J Prod Res, 49
S. Gauri (2009)
Modeling product-mix planning for batches of melt under multiple objectives in a small scale iron foundryProduction Engineering, 3
Z-L Chen (1999)
78INFORMS J Comput, 11
S Dauzère-Pérès (1995)
134Eur J Oper Res, 81
W-Y Ku (2016)
165Comput Oper Res, 73
F Ballestín (2012)
663Optim Eng, 13
M. Dyer, L. Wolsey (1990)
Formulating the single machine sequencing problem with release dates as a mixed integer programDiscret. Appl. Math., 26
SL Nonås (2005)
2351Comput Oper Res, 32
Kaouthar Deghdak, V. T’kindt, J. Bouquard (2016)
Scheduling evacuation operationsJournal of Scheduling, 19
L-P Bigras (2008)
133INFORMS J Comput, 20
N Boland (2016)
14INFORMS J Comput, 28
Rodolfo Teixeira, F. Fernandes, Néocles Pereira (2010)
Binary integer programming formulations for scheduling in market-driven foundriesComput. Ind. Eng., 59
A. Obeid, S. Dauzére-Pérés, C. Yugma, Ariane Ferreira (2010)
Scheduling job families on non identical parallel machines under Run-To-Run control constraints
Sara Velez, Yachao Dong, C. Maravelias (2017)
Changeover formulations for discrete-time mixed-integer programming scheduling modelsEur. J. Oper. Res., 260
AS Manne (1960)
219Oper Res, 8
E. Hans, S. Velde (2011)
The lot sizing and scheduling of sand casting operationsInternational Journal of Production Research, 49
Wen-Yang Ku, J. Beck (2016)
Mixed Integer Programming models for job shop scheduling: A computational analysisComput. Oper. Res., 73
N. Boland, R. Clement, H. Waterer (2016)
A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling ProblemsINFORMS J. Comput., 28
Y Pan (2017)
197Ann Oper Res, 249
Zhi-Long Chen, Warrren Powell (1999)
Solving Parallel Machine Scheduling Problems by Column GenerationINFORMS J. Comput., 11
A. Manne (1960)
On the Job-Shop Scheduling ProblemOperations Research, 8
G. Matičević, N. Majdandžić, T. Lovrić (2008)
Production Scheduling Model in Aluminium FoundryStrojniski Vestnik-journal of Mechanical Engineering, 54
ME Dyer (1990)
255Discret Appl Math, 26
A Obeid (2014)
221Ann Oper Res, 213
École des Mines de Saint-Étienne
J. Sousa, L. Wolsey (1992)
A time indexed formulation of non-preemptive single machine scheduling problemsMathematical Programming, 54
M. Samà, A. D’Ariano, Paolo D'Ariano, D. Pacciarelli (2017)
Scheduling models for optimal aircraft traffic control at busy airports: Tardiness, priorities, equity and violations considerationsOmega-international Journal of Management Science, 67
SK Gauri (2009)
Modeling product-mix planning for batches of melt under multiple objectives in a small scale iron foundryProd Eng Res Devel, 3
K Deghdak (2016)
467J Sched, 19
Zhi-Long Chen, Warrren Powell (1999)
A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problemEur. J. Oper. Res., 116
Sigrid Nonås, K. Olsen (2005)
Optimal and heuristic solutions for a scheduling problem arising in a foundryComput. Oper. Res., 32
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
C. Artigues (2017)
On the strength of time-indexed formulations for the resource-constrained project scheduling problemOper. Res. Lett., 45
This paper outlines a mathematical model to solve a scheduling problem for a company engineering and producing propellers to order. Nonås and Olsen (Comput Oper Res 32(9):2351–2382, 2005) have previously introduced a Mixed Integer Programming model for this production setting with the objective of minimizing the total tardiness. The mathematical model could however not be used to solve realistic sized problem instances, because of the very large solution time. We propose a new time indexed formulation that can solve most industrial problem instances in less than 10 min. This work is further extended by taking into account limited storage capacity and by proposing different methods to balance between total tardiness and maximum tardiness. We illustrate how the solution time and the criteria change for different setups of the mathematical model and suggest which setup to use for different scenarios. The paper also discusses how the new model can be extended to include unexpected events such as emergency orders and unavailable production equipment.
4OR – Springer Journals
Published: Jun 1, 2023
Keywords: Scheduling; Engineer-to-order; Optimization; Mathematical modeling; 90B35 Deterministic scheduling theory in operations research; 90C11 Mixed integer programming
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.