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

DOI10.1016/J.EJOR.2006.06.061MaRDI QIDQ2467252zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

branch and boundearliness and tardinessempirical resultsfamily setupsheuristic algorithmsinserted idle timesingle machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine group scheduling with family setups to minimize total tardiness
• Minimising earliness and tardiness on parallel machines with sequence-dependent setups
• Single machine scheduling with symmetric earliness and tardiness penalties
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• Minimizing maximum lateness with job families

Cites work

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

Cited in

(12)

• 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
• 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
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• Single machine scheduling to minimize the setup time and the earliness
• Minimizing L _max for the single machine scheduling problem with family set-ups
• Single machine group scheduling with family setups to minimize total tardiness
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
• Single machine batch scheduling problem with family setup times and release dates to minimize makespan
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
• Scheduling with returnable containers

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)