A note on the complexity of the concurrent open shop problem

DOI10.1007/s10951-006-7042-yzbMath1154.90484OpenAlexW2159158649MaRDI QIDQ880556

Thomas A. Roemer

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-006-7042-y

zbMATH Keywords

ComplexityTotal completion timeInternal and external performance measuresOrder scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (17)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time ⋮ Customer order scheduling to minimize the number of late jobs ⋮ The representation of partially-concurrent open shop problems ⋮ Scheduling orders for multiple product types to minimize total weighted completion time ⋮ A learning-based two-stage optimization method for customer order scheduling ⋮ Minimizing the sum of weighted completion times in a concurrent open shop ⋮ Minimizing the total weighted completion time of fully parallel jobs with integer parallel units ⋮ Scheduling Fully Parallel Jobs with Integer Parallel Units ⋮ Scheduling with centralized and decentralized batching policies in concurrent open shops ⋮ Order scheduling with tardiness objective: improved approximate solutions ⋮ Preemptive multiprocessor order scheduling to minimize total weighted flowtime ⋮ Order Scheduling Models: Hardness and Algorithms ⋮ Select and permute: an improved online framework for scheduling to minimize weighted completion time ⋮ Scheduling fully parallel jobs ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Open shops with jobs overlap -- revisited
• Scheduling parallel machines for the customer order problem
• Order scheduling in an environment with dedicated resources in parallel
• Scheduling orders for multiple product types to minimize total weighted completion time
• Open shops with jobs overlap
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• The complexity of customer order scheduling problems on parallel machines
• Coordinated scheduling of customer orders for quick response
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

This page was built for publication: A note on the complexity of the concurrent open shop problem