scientific article; zbMATH DE number 4131935

MaRDI QIDQ3033546zbMATH OpenFDO

Authors I. N. Lushchakova, V. A. Strusevich

Publication date 1989

zbMATH Keywords

arbitrary processing timesmakespanpolynomial-time algorithmpreemptionresource constraintstwo machine open nonpreemptive scheduling

Mathematics Subject Classification ID

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

Recommendations

• Two-Machine Open Shops with Renewable Resources
• An open shop scheduling problem with a non-bottleneck machine
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs
• Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
• The open shop scheduling problem with a given sequence of jobs on one machine
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Non-preemptive two-machine open shop scheduling with non-availability constraints
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• A heuristic for the two-machine open-shop scheduling problem with transportation times

Cited in

(6)

• A two-bottleneck system with binomial yields and rigid demand
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• scientific article; zbMATH DE number 4020835 (Why is no real title available?)
• scientific article; zbMATH DE number 4023001 (Why is no real title available?)
• scientific article; zbMATH DE number 555729 (Why is no real title available?)
• The effects of routing flexibility in a multi-stage pull-type system

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