Single machine scheduling with family setups to minimize total earliness and tardiness
From MaRDI portal
Publication:2467252
DOI10.1016/j.ejor.2006.06.061zbMath1137.90516MaRDI QIDQ2467252
Jatinder N. D. Gupta, Jeffrey E. Schaller
Publication date: 21 January 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.061
branch and bound; heuristic algorithms; single machine scheduling; empirical results; earliness and tardiness; family setups; inserted idle time
90B35: Deterministic scheduling theory in operations research
Related Items
Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints, ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness, Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, Scheduling with returnable containers, Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints, Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint, A survey of scheduling problems with setup times or costs
Cites Work
- Unnamed Item
- A comparison of lower bounds for the single-machine early/tardy problem
- Scheduling with batch setup times and earliness-tardiness penalties
- Earliness-tardiness scheduling with setup considerations
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- The one-machine problem with earliness and tardiness penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
- Single-machine scheduling with early and tardy completion costs