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

DOI10.1016/J.COR.2007.04.006zbMATH Open1170.90400OpenAlexW2038382324MaRDI QIDQ2483517FDOQ2483517

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

Recommendations

• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• A heuristic for single machine scheduling with early and tardy costs

zbMATH Keywords

schedulingsingle machinedispatching rulesearly/tardyquadratic penalties

Mathematics Subject Classification ID

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

Cites Work

• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single machine earliness and tardiness scheduling
• Minimizing the sum of squares lateness on a single machine
• The one-machine problem with earliness and tardiness penalties
• 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
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Single machine scheduling with symmetric earliness and tardiness penalties

Cited In (11)

• Biased random-key genetic algorithms with applications in telecommunications
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• A heuristic for single machine scheduling with early and tardy costs
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• 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
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs

This page was built for publication: Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

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