Unbounded batch scheduling with a common due window on a single machine
From MaRDI portal
Publication:611087
DOI10.1007/s11424-008-9113-yzbMath1201.90095OpenAlexW2168122471MaRDI QIDQ611087
Publication date: 14 December 2010
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-008-9113-y
Related Items
Cites Work
- Scheduling a batching machine
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- Due window scheduling for parallel machines
- Single machine scheduling with common due data assignment in a group technology environment
- Scheduling with batching: A review
- Common due window size and location determination in a single machine scheduling problem
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Parallel Processing and Applied Mathematics
- Parallel machine scheduling with a common due window