Online production planning to maximize the number of on-time orders

DOI10.1007/S10479-018-2928-6MaRDI QIDQ829183zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

competitive analysisschedulingplanning horizononline planning

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
• On-line production order scheduling with preemption penalties
• An online approach to dynamic rescheduling for production planning applications
• On-line integrated production-distribution scheduling problems with capacitated deliveries
• Algorithmic Applications in Management

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• A Periodic Review, Production Planning Model with Uncertain Capacity and Uncertain Demand—Optimality of Extended Myopic Policies
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Bounds for Certain Multiprocessing Anomalies
• Horizon Effects in Aggregate Production Planning with Seasonal Demand
• How much can lookahead help in online single machine scheduling
• Lower bounds on online deadline scheduling with preemption penalties
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• On-line production order scheduling with preemption penalties
• On-line scheduling on a single machine: Maximizing the number of early jobs
• Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
• Online scheduling with known arrival times
• Optimality of Myopic Inventory Policies for Several Substitute Products
• Production Planning Over Time and the Nature of the Expectation and Planning Horizon
• Scheduling. Theory, algorithms, and systems.
• Time bounds for selection

Cited in

(4)

• Terminal inventory level constraints for online production scheduling
• An online approach to dynamic rescheduling for production planning applications
• Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
• Algorithmic Applications in Management

This page was built for publication: Online production planning to maximize the number of on-time orders

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