Column generation heuristics for multiple machine, multiple orders per job scheduling problems
From MaRDI portal
Publication:940892
DOI10.1007/S10479-007-0281-2zbMATH Open1151.90386OpenAlexW1994527731MaRDI QIDQ940892FDOQ940892
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
Recommendations
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
- Scheduling multiple orders per job with various constraints for hybrid flow shop
- Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
- Integrated heuristics for scheduling multiple order jobs in a complex job shop
- Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Decomposition Principle for Linear Programs
- A technical review of column generation in integer programming
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Title not available (Why is that?)
Cited In (8)
- Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
- Scheduling multiple orders per job in a single machine to minimize total completion time
- 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
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- A column generation approach for an employee scheduling problem with multiple shifts and work locations
This page was built for publication: Column generation heuristics for multiple machine, multiple orders per job scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q940892)