Online production planning to maximize the number of on-time orders
From MaRDI portal
Publication:829183
DOI10.1007/s10479-018-2928-6zbMath1467.90007OpenAlexW2810224082WikidataQ129645351 ScholiaQ129645351MaRDI QIDQ829183
Nicholas G. Hall, Marc E. Posner, Chris N. Potts
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/422682/1/PlanningHorizonsAcceptedAnnOR.pdf
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- How much can lookahead help in online single machine scheduling
- Lower bounds on online deadline scheduling with preemption penalties
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Time bounds for selection
- On-line production order scheduling with preemption penalties
- Online Scheduling with Known Arrival Times
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Horizon Effects in Aggregate Production Planning with Seasonal Demand
- A Periodic Review, Production Planning Model with Uncertain Capacity and Uncertain Demand—Optimality of Extended Myopic Policies
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Bounds for Certain Multiprocessing Anomalies
- Optimality of Myopic Inventory Policies for Several Substitute Products
- Production Planning Over Time and the Nature of the Expectation and Planning Horizon
- Scheduling
- On-line scheduling on a single machine: Maximizing the number of early jobs
This page was built for publication: Online production planning to maximize the number of on-time orders
