Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure

DOI10.1016/S0377-2217(01)00140-0zbMath1008.90024MaRDI QIDQ1600885

Tapio Westerlund, Iiro Harjunkoski, Johnny Isaksson, Janne Roslöf

Publication date: 16 June 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

optimization; single-machine scheduling; sequence-dependent setup times; paper-converting industry

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Optimal scheduling for flexible job shop operation, An experimental analysis of solution performance in a resource sharing and scheduling problem, Integer programming approach to reactive scheduling in make-to-order manufacturing, Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill

Uses Software

• CPLEX
• JOBSHOP

Cites Work

• Unnamed Item
• Scheduling in a sequence dependent setup environment with genetic search
• Insertion techniques for the heuristic solution of the job shop problem
• Optimal two- and three-stage production schedules with setup times included
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• A Computational Study of the Job-Shop Scheduling Problem
• A Branch-Bound Solution to the General Scheduling Problem