scientific article
From MaRDI portal
Publication:3470246
zbMath0694.90065MaRDI QIDQ3470246
Jacek Błażewicz, Jayme Luiz Szwarcfiter, Wiesław X. Kubiak
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-hardpolynomial timeunit length jobsadditional resourcesflow shopsminimizing maximum latenessarbitrary number of machinesfinite number of machinesmessage transmission systemsminimal schedule lengthtwo machine case
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (5)
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph ⋮ Flexible flow shop with dedicated buffers ⋮ Scheduling unit-time tasks in renewable resource constrained flowshops ⋮ Flow shop scheduling problem with conflict graphs ⋮ A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
This page was built for publication:
