scientific article; zbMATH DE number 3891075

MaRDI QIDQ3347607zbMATH OpenFDO

Authors Jacek Blazewicz, Jan Węglarz

Publication date 1984

zbMATH Keywords

computational complexityflow shopjob shopmaximum latenessmean flow timeopen shopparallel machinesresource allocationresource constraintsschedule lengthschedule performance measures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) 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

(26)

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

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)