AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES

DOI10.1142/S0217595908001730zbMath1171.90410MaRDI QIDQ3520510

Jorge M. S. Valente

Publication date: 26 August 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

lower bound

Mathematics Subject Classification ID

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

Related Items (7)

Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling ⋮ 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 ⋮ Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ 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

• Minimizing the sum of squares lateness on a single machine
• Sequencing with Earliness and Tardiness Penalties: A Review
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates

This page was built for publication: AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES