UET flow shop scheduling with delays

DOI10.1051/ITA/1996300100231zbMATH Open0851.68036OpenAlexW26003909MaRDI QIDQ4889815FDOQ4889815

Authors: V. J. Rayward-Smith, Djamal Rebaine 

Publication date: 25 November 1996

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92524

zbMATH Keywords

NP-completeness

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Optimal two- and three-stage production schedules with set-up time included
• Title not available (Why is that?)
• The Complexity of Flowshop and Jobshop Scheduling

Cited In (4)

• Analysis of heuristics for the UET two-machine flow shop problem with time delays
• Exact method for the two-machine flow-shop problem with time delays
• Polynomial time algorithms for the UET permutation flowshop problem with time delays
• Scheduling flexible flowshops with unit-time operations and minimum time delays

This page was built for publication: UET flow shop scheduling with delays

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