Single-machine scheduling with precedence constraints and position-dependent processing times
From MaRDI portal
Publication:350351
DOI10.1016/j.apm.2012.02.055zbMath1351.90103OpenAlexW2013936611MaRDI QIDQ350351
Publication date: 7 December 2016
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2012.02.055
Related Items
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, Total tardiness minimization in permutation flowshop with deterioration consideration, Scheduling identical jobs on uniform parallel machines under position-based learning effects, Scheduling with a position-weighted learning effect and job release dates, Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times, Precedence constrained parallel-machine scheduling of position-dependent jobs, Minmax scheduling problems with common due-date and completion time penalty, Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints, Single-machine scheduling problems with precedence constraints and simple linear deterioration
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling chains to minimize mean flow time
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- Time-dependent scheduling
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Scheduling jobs under decreasing linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Single-machine group scheduling problems with deterioration consideration
- A state-of-the-art review on scheduling with learning effects
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Multi-machine scheduling with deteriorating jobs and scheduled maintenance
- Scheduling with time dependent processing times: Review and extensions
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Scheduling jobs with position-dependent processing times
- Flow shop scheduling problems with deteriorating jobs under dominating machines
