Open shops with jobs overlap -- revisited

DOI10.1016/J.EJOR.2003.11.023zbMATH Open1071.90017OpenAlexW2091666510MaRDI QIDQ706904FDOQ706904

Authors: Haibing Li, Joseph Y.-T. Leung, Michael L. Pinedo, Chelliah Sriskandarajah 

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.11.023

Recommendations

• Open shops with jobs overlap
• On the complexity of open shop scheduling with time lags
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Open shop scheduling with makespan and total completion time criteria
• A note on the complexity of the concurrent open shop problem

zbMATH Keywords

Open shopsStrongly NP-hardTotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Open shops with jobs overlap

Cited In (8)

• A note on the complexity of the concurrent open shop problem
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime
• Scheduling orders for multiple product types with due date related objectives
• A learning-based two-stage optimization method for customer order scheduling
• Order scheduling in an environment with dedicated resources in parallel
• Scheduling orders for multiple product types to minimize total weighted completion time
• Some positive news on the proportionate open shop problem
• Scheduling with centralized and decentralized batching policies in concurrent open shops

This page was built for publication: Open shops with jobs overlap -- revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706904)