scientific article; zbMATH DE number 3891075

MaRDI QIDQ3347607zbMATH OpenFDO

Authors Jacek Blazewicz, Jan Węglarz

Publication date 1984

zbMATH Keywords

computational complexitymaximum latenessresource allocationflow shopparallel machinesresource constraintsopen shopjob shopmean flow timeschedule lengthschedule performance measures

Mathematics Subject Classification ID

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

Recommendations

• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• scientific article; zbMATH DE number 4095196
• scientific article; zbMATH DE number 4072697
• Scheduling of resource tasks
• Minimizing mean flow time with parallel processors and resource constraints

Cited in

(24)

• scientific article; zbMATH DE number 5035881 (Why is no real title available?)
• A multivariate complexity analysis of the material consumption scheduling problem
• The complexity of multidimensional periodic scheduling
• scientific article; zbMATH DE number 7650890 (Why is no real title available?)
• scientific article; zbMATH DE number 3898230 (Why is no real title available?)
• NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
• Modeling of a scheduling problem with expected availability of resources
• Assessing the resource usage in scheduling with incompatibilities
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• Fast combination of scheduling chains under resource and time constraints
• Complexity of project scheduling problem with nonrenewable resources
• A historical note on the complexity of scheduling problems
• On the complexity of interval scheduling with a resource constraint
• Computer-Aided complexity classification of combinational problems
• Resource holding times: Computation and optimization
• Resource allocation by means of project networks: complexity results
• scientific article; zbMATH DE number 3854787 (Why is no real title available?)
• Problem of parallel machines with polymatroidal constraints
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• scientific article; zbMATH DE number 3894816 (Why is no real title available?)
• On the NP-hardness of two scheduling problems under linear constraints
• On the complexity of adjacent resource scheduling
• Complexity of the scheduling language RSV
• Scheduling of resource tasks

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)