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

DOI10.1016/J.AMC.2006.06.086zbMATH Open1121.90056OpenAlexW2110066427MaRDI QIDQ870129FDOQ870129

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 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)

Cites Work

• Title not available (Why is that?)
• A Dynamic Programming Approach to Sequencing Problems
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Coordinated scheduling of customer orders for quick response
• Scheduling parallel machines for the customer order problem
• Order scheduling in an environment with dedicated resources in parallel
• Scheduling multi-operation jobs on a single machine
• Tradeoff between setup times and carrying costs for finished items
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• The complexity of customer order scheduling problems on parallel machines
• 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
• Job oriented production scheduling

Cited In (3)

• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Optimising lot sizing and order scheduling with non-linear production rates

   Recommendations

• The complexity of customer order scheduling problems on parallel machines 👍 👎
• Title not available (Why is that?) 👍 👎
• 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. 👍 👎
• Title not available (Why is that?) 👍 👎

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)