Minimizing the sum of squares lateness on a single machine

DOI10.1016/S0377-2217(01)00322-8zbMath1073.90515OpenAlexW2093390609MaRDI QIDQ1848630

Jeffrey E. Schaller

Publication date: 13 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00322-8

zbMATH Keywords

SchedulingBranch and Bound

Mathematics Subject Classification ID

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

Related Items (11)

On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ 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 ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES ⋮ Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties ⋮ 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

• The Single Machine Problem with a Quadratic Cost Function of Completion Times
• Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
• A dual algorithm for the one-machine scheduling problem
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure

This page was built for publication: Minimizing the sum of squares lateness on a single machine