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

DOI10.1016/j.amc.2006.06.086zbMath1121.90056OpenAlexW2110066427MaRDI QIDQ870129

Jay B. Ghosh, Erdal Erel

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 complexitymachine schedulingdynamic programming

Mathematics Subject Classification ID

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

Related Items (2)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Optimising lot sizing and order scheduling with non-linear production rates

Cites Work

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

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