Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

DOI10.1016/j.cor.2007.04.006zbMath1170.90400OpenAlexW2038382324MaRDI QIDQ2483517

Jorge M. S. Valente, Rui A. F. S. Alves

Publication date: 28 April 2008

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

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/2894

zbMATH Keywords

schedulingsingle machinedispatching rulesearly/tardyquadratic penalties

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties, Metaheuristics for the single machine weighted quadratic tardiness scheduling problem, A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties, No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines, Biased random-key genetic algorithms with applications in telecommunications, Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem

Cites Work

• Single machine earliness and tardiness scheduling
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• Minimizing the sum of squares lateness on a single machine
• Single machine scheduling with symmetric earliness and tardiness penalties
• The one-machine problem with earliness and tardiness penalties
• Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Sequencing with Earliness and Tardiness Penalties: A Review
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Improved lower bounds for the early/tardy scheduling problem with no idle time