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

DOI10.1016/J.COR.2007.04.006MaRDI QIDQ2483517zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dispatching rulesearly/tardyquadratic penaltiesschedulingsingle machine

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(11)

• A heuristic for single machine scheduling with early and tardy costs
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• Biased random-key genetic algorithms with applications in telecommunications
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags
• No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• 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)