An improved precedence rule for single machine sequencing problems with quadratic penalty

DOI10.1016/S0377-2217(99)00207-6zbMath0952.90011OpenAlexW1980453217MaRDI QIDQ1580988

Sakib A. Mondal, Anup K. Sen

Publication date: 21 January 2001

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00207-6

zbMATH Keywords

scheduling theorysingle machinesequencingheuristicquadratic penalty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

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 ⋮ The local-global conjecture for scheduling with non-linear cost ⋮ Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires ⋮ Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints ⋮ On the complexity of the single machine scheduling problem minimizing total weighted delay penalty ⋮ For the airplane refueling problem local precedence implies global precedence

Cites Work

• Unnamed Item
• Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function 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: An improved precedence rule for single machine sequencing problems with quadratic penalty