Multiple orders per job batch scheduling with incompatible jobs
From MaRDI portal
Publication:940891
DOI10.1007/s10479-007-0286-xzbMath1153.90420MaRDI QIDQ940891
Scott J. Mason, Vishnu Erramilli
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-0286-x
Related Items
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, A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
Cites Work
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- The Batch Loading and Scheduling Problem
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families