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

DOI10.1016/J.COR.2005.09.003MaRDI QIDQ868992zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Improved lower bounds for the early/tardy scheduling problem with no idle time
• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• scientific article; zbMATH DE number 5151903
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• Single machine earliness and tardiness scheduling

Cites work

• scientific article; zbMATH DE number 151905 (Why is no real title available?)
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Minimizing mean absolute deviation of completion times about a common due date
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Minimizing the average deviation of job completion times about a common due date
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• 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
• The Single Machine Early/Tardy Problem

Cited in

(11)

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

This page was built for publication: A comparison of lower bounds for the single-machine early/tardy problem

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