Analysis of a linearization heuristic for single-machine scheduling to maximize profit
From MaRDI portal
Publication:3313596
DOI10.1007/BF02612362zbMATH Open0531.90045OpenAlexW2066168158MaRDI QIDQ3313596FDOQ3313596
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
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
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Bounds on Multiprocessing Timing Anomalies
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Title not available (Why is that?)
- Minimizing Total Costs in One-Machine Scheduling
- A dual algorithm for the one-machine scheduling problem
- Worst-Case Analysis of Heuristic Algorithms
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
- Analysis of a linearization heuristic for single-machine scheduling to maximize profit
Cited In (5)
- Scheduling crackdowns on illicit drug markets
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
- Single machine scheduling with nonlinear cost functions
- Analysis of a linearization heuristic for single-machine scheduling to maximize profit
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
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)
