Group sequencing around a common due date
From MaRDI portal
Publication:937402
DOI10.1016/J.DISOPT.2006.04.003zbMath1170.90388OpenAlexW2017381118MaRDI QIDQ937402
Publication date: 15 August 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/1263
Related Items (2)
A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect ⋮ A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine group scheduling with resource dependent setup and processing times
- Minimizing the number of late jobs under the group technology assumption
- The complexity of scheduling job families about a common due date
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Single machine group scheduling with ordered criteria
- Scheduling with batching: A review
- Sequencing with Earliness and Tardiness Penalties: A Review
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
This page was built for publication: Group sequencing around a common due date