The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic

DOI10.1287/OPRE.36.5.742MaRDI QIDQ3812023zbMATH OpenOpenAlexFDO

Authors Marc E. Posner

Publication date 1988

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.36.5.742

zbMATH Keywords

deadline constraintsgreedy heuristicone-machine weighted completion time problemoptimality conditionworst case bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing Weighted Completion Times with Deadlines
• A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
• A branch and bound algorithm for minimizing weighted completion times with deadlines
• Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
• Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines

Cited in

(7)

• Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
• A Global Constraint for Total Weighted Completion Time
• A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
• scientific article; zbMATH DE number 7529517 (Why is no real title available?)
• Reducibility among single machine weighted completion time scheduling problems

This page was built for publication: The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3812023)