Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints
From MaRDI portal
Publication:2439528
DOI10.1007/s11590-012-0582-5zbMath1288.90115MaRDI QIDQ2439528
Publication date: 14 March 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0582-5
scheduling; single machine; polynomial algorithm; maximum cost; variable job processing times; \(k\)-partite precedence
90C35: Programming involving graphs or networks
Related Items
Precedence constrained parallel-machine scheduling of position-dependent jobs, A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
- Scheduling linearly shortening jobs under precedence constraints
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Time-dependent scheduling
- Scheduling time-dependent jobs under mixed deterioration
- Scheduling jobs under simple linear deterioration
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- The complexity of short schedules for uet bipartite graphs
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Unnamed Item
- Unnamed Item