Customer order scheduling to minimize the number of late jobs

DOI10.1016/J.EJOR.2006.10.021MaRDI QIDQ2371386zbMATH OpenOpenAlexFDO

Authors B. M. T. Lin, Alexander Kononov

Publication date 4 July 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2006.10.021

zbMATH Keywords

approximabilityapproximation algorithmmulticover problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Prioritized customer order scheduling to maximize throughput
• Tailoring customer order scheduling search algorithms
• Scheduling on parallel machines to minimise maximum lateness for the customer order problem
• Scheduling multiple orders per job in a single machine to minimize total completion time
• scientific article; zbMATH DE number 6611746
• Coordinated scheduling of customer orders for quick response
• Order scheduling with tardiness objective: improved approximate solutions
• Note: Due-date Assignment to Multi-Job Customer Orders
• Scheduling orders for multiple product types to minimize total weighted completion time
• scientific article; zbMATH DE number 1300389

Cites work

• A fast approximation algorithm for the multicovering problem
• A note on the complexity of the concurrent open shop problem
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Open shops with jobs overlap
• Scheduling orders for multiple product types with due date related objectives

Cited in

(12)

• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• Order scheduling with tardiness objective: improved approximate solutions
• Tailoring customer order scheduling search algorithms
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• Minimizing the number of tardy jobs in two-machine settings with common due date
• Scheduling with centralized and decentralized batching policies in concurrent open shops
• Note: Due-date Assignment to Multi-Job Customer Orders
• An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems
• Integer programming models and metaheuristics for customer order scheduling
• Customer order scheduling on a serial-batch machine in precast bridge construction
• New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: a computational evaluation
• Minimizing maximum delivery completion time for order scheduling with rejection

This page was built for publication: Customer order scheduling to minimize the number of late jobs

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