Scheduling parallel machines for the customer order problem

DOI10.1007/s10951-005-5315-5zbMath1123.90039OpenAlexW2087304354MaRDI QIDQ880492

Marc E. Posner, Jaehwan Yang

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-5315-5

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines ⋮ New approximate algorithms for the customer order scheduling problem with total completion time objective ⋮ An order scheduling problem with position-based learning effect ⋮ Customer order scheduling on a single machine with family setup times: complexity and algorithms ⋮ A note on the complexity of the concurrent open shop problem ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ Metaheuristics for order scheduling problem with unequal ready times ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time ⋮ Preemptive multiprocessor order scheduling to minimize total weighted flowtime ⋮ Scheduling on parallel machines to minimise maximum lateness for the customer order problem

Cites Work

• 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
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• The customer order lead-time problem on parallel machines

This page was built for publication: Scheduling parallel machines for the customer order problem