Customer order scheduling on a single machine with family setup times: complexity and algorithms

DOI10.1016/J.AMC.2006.06.086MaRDI QIDQ870129zbMATH OpenOpenAlexFDO

Authors Erdal Erel, Jay B. Ghosh

Publication date 12 March 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/23541

zbMATH Keywords

computational complexitydynamic programmingmachine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The complexity of customer order scheduling problems on parallel machines
• Minimizing the range of order completion times with multiple job classes
• A note on the complexity of family scheduling to minimize the number of late jobs
• Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
• scientific article; zbMATH DE number 2221456

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Coordinated scheduling of customer orders for quick response
• Job oriented production scheduling
• Note: Due-date Assignment to Multi-Job Customer Orders
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Order scheduling in an environment with dedicated resources in parallel
• Scheduling multi-operation jobs on a single machine
• Scheduling parallel machines for the customer order problem
• Sequencing with setup time and order tardiness trade-offs
• The complexity of customer order scheduling problems on parallel machines
• The customer order lead-time problem on parallel machines
• Tradeoff between setup times and carrying costs for finished items

Cited in

(5)

• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• Minimizing the makespan on a single machine subject to modular setups
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• The complexity of customer order scheduling problems on parallel machines
• Optimising lot sizing and order scheduling with non-linear production rates

This page was built for publication: Customer order scheduling on a single machine with family setup times: complexity and algorithms

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