A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties

DOI10.1016/j.cor.2012.03.004zbMath1349.90364OpenAlexW2084434901MaRDI QIDQ339632

Mohammad Hasan, M. Dambrine

Publication date: 11 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.004

zbMATH Keywords

schedulingbranch-and-boundsingle machinequadratic earliness and tardiness

Mathematics Subject Classification ID

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

Related Items

Distributionally robust single machine scheduling with the total tardiness criterion, Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties, Single machine scheduling problem with interval processing times to minimize mean weighted completion time, Metaheuristics for the single machine weighted quadratic tardiness scheduling problem, Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

Cites Work

• Unnamed Item
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
• Single machine earliness and tardiness scheduling
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• An improved precedence rule for single machine sequencing problems with quadratic penalty
• New results on the completion time variance minimization
• Minimizing the sum of squares lateness on a single machine
• Processing-plus-wait due dates in single-machine scheduling
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• Sequencing with Earliness and Tardiness Penalties: A Review
• AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
• The Single Machine Early/Tardy Problem
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling
• Improved lower bounds for the early/tardy scheduling problem with no idle time
• Algorithmic Applications in Management