An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
From MaRDI portal
Publication:1412717
DOI10.1016/S0167-6377(03)00048-8zbMath1052.90037MaRDI QIDQ1412717
Publication date: 25 November 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ Pareto optima for total weighted completion time and maximum lateness on a single machine ⋮ A Lagrangian approach to single-machine scheduling problems with two competing agents ⋮ On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems
Cites Work
- Unnamed Item
- Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
- An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
- Minimizing Weighted Completion Times with Deadlines
- A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
- ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA
- A note on a scheduling problem with dual criteria
- Scheduling to minimize the weighted sum of completion times with secondary criteria
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A note on the extension of a result on scheduling with secondary criteria
This page was built for publication: An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time.
