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

DOI10.1007/BF02612362zbMATH Open0531.90045OpenAlexW2066168158MaRDI QIDQ3313596FDOQ3313596

Authors Marshall L. Fisher, Abba M. Krieger

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)

Recommendations

• Single machine scheduling with nonlinear cost functions
• Maximization problems in single machine scheduling
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• scientific article; zbMATH DE number 4012297
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• A dual algorithm for the one-machine scheduling problem
• Analysis of a linearization heuristic for single-machine scheduling to maximize profit
• Bounds on Multiprocessing Timing Anomalies
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Minimizing Total Costs in One-Machine Scheduling
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Worst-Case Analysis of Heuristic Algorithms

Cited in

(5)

• Scheduling crackdowns on illicit drug markets
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• Single machine scheduling with nonlinear cost functions
• 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

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

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