Analysis of a linearization heuristic for single-machine scheduling to maximize profit

DOI10.1007/BF02612362zbMath0531.90045OpenAlexW2066168158MaRDI QIDQ3313596

Abba M. Krieger, Marshall L. Fisher

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02612362

zbMATH Keywords

single machineheuristic algorithmmaximization of total profitno preemption

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires ⋮ Analysis of a linearization heuristic for single-machine scheduling to maximize profit ⋮ Single machine scheduling with nonlinear cost functions ⋮ Scheduling crackdowns on illicit drug markets

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of a linearization heuristic for single-machine scheduling to maximize profit
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Worst-Case Analysis of Heuristic Algorithms
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Analysis of a linearization heuristic for single-machine scheduling to maximize profit