Scheduling of tasks with effectiveness precedence constraints

DOI10.1007/s11590-019-01440-xzbMath1433.90063OpenAlexW2947088181MaRDI QIDQ2300636

Thomas C. Sharkey, Emily A. 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

schedulingsingle machine schedulingtotal weighted completion timeeffectivness precedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

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