The proportionate two-machine no-wait job shop scheduling problem

DOI10.1016/j.ejor.2016.01.010zbMath1346.90360OpenAlexW2230700996MaRDI QIDQ322845

Christos P. Koulamas, Shrikant S. Panwalkar

Publication date: 7 October 2016

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

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

zbMATH Keywords

job shopno-waitproportionate

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

A survey of job shop scheduling problem: the types and models ⋮ On the complexity of proportionate open shop and job shop problems ⋮ An asynchronous parallel disassembly planning based on genetic algorithm ⋮ A survey of scheduling problems with no-wait in process

Cites Work

• Unnamed Item
• The two-machine no-wait general and proportionate open shop makespan problem
• Inapproximability results for no-wait job shop scheduling.
• Some no-wait shops scheduling problems: Complexity aspect
• Complexity of Scheduling Shops with No Wait in Process
• Flowshop sequencing problem with ordered processing time matrices: A general case

This page was built for publication: The proportionate two-machine no-wait job shop scheduling problem