Column generation heuristics for multiple machine, multiple orders per job scheduling problems

DOI10.1007/s10479-007-0281-2zbMath1151.90386OpenAlexW1994527731MaRDI QIDQ940892

Jagadish Jampani, Scott J. Mason

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0281-2

zbMATH Keywords

machine schedulingcolumn generationsemiconductor manufacturing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (4)

Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times ⋮ Scheduling multiple orders per job in a single machine to minimize total completion time ⋮ Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• A technical review of column generation in integer programming
• Decomposition Principle for Linear Programs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

This page was built for publication: Column generation heuristics for multiple machine, multiple orders per job scheduling problems