The complexity of customer order scheduling problems on parallel machines
From MaRDI portal
Publication:1777163
DOI10.1016/j.cor.2003.12.008zbMath1074.90021OpenAlexW2040089832MaRDI QIDQ1777163
Publication date: 12 May 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2003.12.008
Related Items (8)
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ New approximate algorithms for the customer order scheduling problem with total completion time objective ⋮ Customer order scheduling on a single machine with family setup times: complexity and algorithms ⋮ Spatial and temporal optimization for smart warehouses with fast turnover ⋮ A note on the complexity of the concurrent open shop problem ⋮ An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems ⋮ Scheduling on parallel machines to minimise maximum lateness for the customer order problem
Cites Work
- Unnamed Item
- Batching in single operation manufacturing systems
- Batching and scheduling. Models and methods for several problem classes
- Single machine hierarchical scheduling with customer orders and multiple job classes
- Scheduling the production of two-component jobs on a single machine
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Groups of Jobs on a Single Machine
- The customer order lead-time problem on parallel machines
This page was built for publication: The complexity of customer order scheduling problems on parallel machines
