Precedence constrained parallel-machine scheduling of position-dependent jobs

DOI10.1007/s11590-016-1075-8zbMath1380.90125OpenAlexW2516825788WikidataQ59610694 ScholiaQ59610694MaRDI QIDQ1676479

Bartłomiej Przybylski

Publication date: 9 November 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-016-1075-8

zbMATH Keywords

polynomial algorithmprecedence constraintsmaximum completion timeparallel-machine schedulingtotal weighted completion timevariable job processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times

Cites Work

• Single-machine scheduling with precedence constraints and position-dependent processing times
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Isomorphic scheduling problems
• Time-dependent scheduling
• Scheduling with general job-dependent learning curves.
• Single-machine scheduling problems with precedence constraints and simple linear deterioration
• Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints
• Single machine group scheduling with time and position dependent processing times
• A state-of-the-art review on scheduling with learning effects
• Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
• Multiagent Scheduling