An improved precedence rule for single machine sequencing problems with quadratic penalty
From MaRDI portal
Publication:1580988
DOI10.1016/S0377-2217(99)00207-6zbMath0952.90011MaRDI QIDQ1580988
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
90B35: Deterministic scheduling theory in operations research
Related Items
A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties, On the complexity of the single machine scheduling problem minimizing total weighted delay penalty, Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires, For the airplane refueling problem local precedence implies global precedence, The local-global conjecture for scheduling with non-linear cost, Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints, Solving a stochastic single machine problem with initial idle time and quadratic objective
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