scientific article

zbMATH Open0558.90043MaRDI QIDQ3347607

Jan Węglarz, Jacek Blazewicz

Publication date: 1984

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

zbMATH Keywords

computational complexityparallel machinesresource allocationflow shopopen shopjob shopmaximum latenessresource constraintsmean flow timeschedule lengthschedule performance measures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (9)

Modeling of a scheduling problem with expected availability of resources ⋮ Title not available (Why is that?) ⋮ Resource holding times: Computation and optimization ⋮ Title not available (Why is that?) ⋮ Fast combination of scheduling chains under resource and time constraints ⋮ A multivariate complexity analysis of the material consumption scheduling problem ⋮ Title not available (Why is that?) ⋮ Assessing the resource usage in scheduling with incompatibilities ⋮ The complexity of multidimensional periodic scheduling

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 Q3347607)