Single machine scheduling with family setups to minimize total earliness and tardiness

DOI10.1016/J.EJOR.2006.06.061zbMATH Open1137.90516OpenAlexW2073187409MaRDI QIDQ2467252FDOQ2467252

Jeffrey E. Schaller, Jatinder N. D. Gupta

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

zbMATH Keywords

empirical resultssingle machine schedulingbranch and boundheuristic algorithmsfamily setupsearliness and tardinessinserted idle time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single-machine scheduling with early and tardy completion costs
• Earliness-tardiness scheduling with setup considerations
• The one-machine problem with earliness and tardiness penalties
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• A comparison of lower bounds for the single-machine early/tardy problem
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Scheduling with batch setup times and earliness-tardiness penalties

Cited In (12)

• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
• Heuristics for single machine scheduling problem with family setup times
• Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
• Single machine scheduling to minimize the setup time and the earliness
• Single machine batch scheduling problem with family setup times and release dates to minimize makespan
• Single machine group scheduling with family setups to minimize total tardiness
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
• Scheduling with returnable containers
• A survey of scheduling problems with setup times or costs
• Minimizing L _max for the single machine scheduling problem with family set-ups
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness

This page was built for publication: Single machine scheduling with family setups to minimize total earliness and tardiness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467252)