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

DOI10.1016/J.COR.2012.03.004MaRDI QIDQ339632zbMATH OpenOpenAlexFDO

Authors K. Kianfar, G. Moslehi

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

schedulingsingle machinebranch-and-boundquadratic earliness and tardiness

Mathematics Subject Classification ID

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

Recommendations

• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties

Cites work

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

Cited in

(15)

• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
• AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
• scientific article; zbMATH DE number 3864980 (Why is no real title available?)
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• Distributionally robust single machine scheduling with the total tardiness criterion

This page was built for publication: A branch-and-bound algorithm for single machine scheduling 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 Q339632)