On The Complexity Of The Process Shop

DOI10.1080/03155986.1994.11732241MaRDI QIDQ4304828zbMATH OpenOpenAlexFDO

Authors Amar Ramudhin, H. Donald Ratliff

Publication date 31 August 1994

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1994.11732241

zbMATH Keywords

flowshopjobshopopenshopindependent parallel processorsno-wait schedulestwo-stage processing system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Some no-wait shops scheduling problems: Complexity aspect
• scientific article; zbMATH DE number 3860868
• scientific article; zbMATH DE number 22879
• scientific article; zbMATH DE number 555729
• The complexity of cyclic shop scheduling problems

Cited in

(4)

• Analysis of multi-stage open shop processing systems
• Analysis of multi-stage open shop processing systems
• A process scheduling problem arising from chemical production planning
• scientific article; zbMATH DE number 3941255 (Why is no real title available?)

This page was built for publication: On The Complexity Of The Process Shop

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