A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints

• Published in: European journal of operational research Vol. 235; no. 3; pp. 540 - 552
• Main Author: Detienne, Boris
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 16.06.2014; Elsevier Sequoia S.A; Elsevier
• Subjects: Availability; Availability constraints; Computer Science; Exact method; Integer programming; Knapsack problem; Late jobs; Linear programming; Mathematical models; Mathematics; Mixed integer; Modeling; Numerical analysis; Operational research; Operations Research; Optimization; Optimization and Control; Production scheduling; Scheduling; Studies; Integer programming; Scheduling; Availability constraints; Late jobs; Modeling; Exact method

•A generic model is proposed for minimizing the number of late jobs on one machine.•Machine availability constraints, non-resumable and resumable jobs are considered.•An efficient mixed integer linear program is described as well as improvements.•Most 500-job instances can be solved to optimality wi...