Minimizing the weighted sum of squared tardiness on a single machine

DOI10.1016/j.cor.2011.07.018zbMath1251.90185OpenAlexW2055779459MaRDI QIDQ1762060

Jeffrey E. Schaller, Jorge M. S. Valente

Publication date: 15 November 2012

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

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/3455

zbMATH Keywords

schedulingbranch and boundsingle machineweighted squared tardiness

Mathematics Subject Classification ID

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

Related Items (7)

From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints ⋮ Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem

Cites Work

• Unnamed Item
• Dominance rules in combinatorial optimization problems
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Minimizing the sum of squares lateness on a single machine
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• Technical Note—A Note on the Weighted Tardiness Problem
• 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
• Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure
• Minimizing Total Costs in One-Machine Scheduling
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
• New Precedence Theorems for One-Machine Weighted Tardiness
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

This page was built for publication: Minimizing the weighted sum of squared tardiness on a single machine