A comparison of lower bounds for the single-machine early/tardy problem

DOI10.1016/j.cor.2005.09.003zbMath1144.90398OpenAlexW1980885413MaRDI QIDQ868992

Jeffrey E. Schaller

Publication date: 26 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.09.003

zbMATH Keywords

heuristicsschedulingbranch-and-boundsequencing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling, Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint, Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness, Single machine scheduling with family setups to minimize total earliness and tardiness, Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed, A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties, BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS

Cites Work

• Unnamed Item
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Single-machine scheduling with early and tardy completion costs