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

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

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

Publication date: 16 June 2002

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00140-0

zbMATH Keywords

optimizationsingle-machine schedulingsequence-dependent setup timespaper-converting industry

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

A discrete time reactive scheduling model for new order insertion in job shop, make-to-order industries ⋮ Operating room scheduling with generalized disjunctive programming ⋮ Integer programming approach to reactive scheduling in make-to-order manufacturing ⋮ Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources ⋮ An experimental analysis of solution performance in a resource sharing and scheduling problem ⋮ MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry ⋮ Optimal scheduling for flexible job shop operation ⋮ An efficient MILP-based decomposition strategy for solving large-scale scheduling problems in the shipbuilding industry ⋮ Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill ⋮ A hybrid method for large-scale short-term scheduling of make-and-pack production processes

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

This page was built for publication: Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure