Scheduling of tasks with effectiveness precedence constraints

DOI10.1007/S11590-019-01440-XMaRDI QIDQ2300636zbMATH OpenOpenAlexFDO

Authors Thomas C. Sharkey, Emily Heath, John E. Mitchell

Publication date 27 February 2020

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-019-01440-x

zbMATH Keywords

effectivness precedence constraintsschedulingsingle machine schedulingtotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Task scheduling with precedence constraints to minimize the total completion time
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• On the approximability of single-machine scheduling with precedence constraints
• Online Scheduling of Precedence Constrained Tasks
• Approximation algorithms for scheduling with resource and precedence constraints

Cites work

• A polyhedral approach to single-machine scheduling problems.
• Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
• On the complexity of scheduling unit-time jobs with or-precedence constraints
• On-line scheduling to minimize average completion time revisited.
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
• Scheduling Tasks with AND/OR Precedence Constraints
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling with AND/OR Precedence Constraints
• Scheduling. Theory, algorithms, and systems.
• Single-machine scheduling problems with past-sequence-dependent setup times
• Single-Machine Scheduling with Precedence Constraints
• The relation of time indexed formulations of single machine scheduling problems to the node packing problem

Cited in

(3)

• Preemptive scheduling with variable profile, precedence constraints and due dates
• Task scheduling with precedence constraints to minimize the total completion time
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints

This page was built for publication: Scheduling of tasks with effectiveness precedence constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300636)