Scheduling linearly shortening jobs under precedence constraints

DOI10.1016/j.apm.2010.11.012zbMath1217.90104OpenAlexW2091290638MaRDI QIDQ552447

Tsung-Chyan Lai, Ming-Huang Chiang, Stanisław Gawiejnowicz

Publication date: 21 July 2011

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2010.11.012

zbMATH Keywords

polynomial algorithmsprecedence constraintsshortening jobstime-dependent scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Time-dependent scheduling
• A note on single-machine group scheduling problems with position-based learning effect
• Complexity of scheduling tasks with time-dependent execution times
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• A concise survey of scheduling with time-dependent processing times
• A state-of-the-art review on scheduling with learning effects
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Scheduling with time dependent processing times: Review and extensions
• The Recognition of Series Parallel Digraphs
• Scheduling jobs with position-dependent processing times
• Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time

This page was built for publication: Scheduling linearly shortening jobs under precedence constraints