scientific article; zbMATH DE number 1061006

MaRDI QIDQ4354348zbMATH OpenFDO

Authors Markus W. Schäffter

Publication date 14 September 1997

zbMATH Keywords

communication delaysforbidden setsidentical parallel machinesresource constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling jobs with communication delays: using infeasible solutions for approximation
• Scheduling with forbidden sets
• Three, four, five, six, or the complexity of scheduling with communication delays
• Scheduling series--parallel orders subject to 0/1-communication delays

Cited in

(13)

• On the complexity of scheduling with large communication delays
• Approximation algorithms for scheduling with a limited number of communications
• A very difficult scheduling problem with communication delays
• Scheduling UET-UCT outforests to minimize maximum lateness
• Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
• Scheduling in the presence of processor networks : complexity and approximation
• Scheduling on Two Unbounded Resources with Communication Costs
• Optimal schedules for d-D grid graphs with communication delays
• An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
• Scheduling with forbidden sets
• scientific article; zbMATH DE number 7764095 (Why is no real title available?)
• Sensitivity bounds for machine scheduling with uncertain communication delays
• Complexity and approximation for precedence constrained scheduling problems with large communication delays

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