scientific article; zbMATH DE number 3643014

zbMATH Open0413.90028MaRDI QIDQ3048552FDOQ3048552

Authors: Fiala Tibor 

Publication date: 1977

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational complexityschedulingnear optimal solutiongeneral flow-shop problemJohnson's three- machine problemNp-complete problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• On some geometric methods in scheduling theory: A survey

This page was built for publication:

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