A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
From MaRDI portal
Publication:628666
DOI10.1007/s11590-010-0202-1zbMath1213.90127OpenAlexW2016335388MaRDI QIDQ628666
Publication date: 14 March 2011
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0202-1
Related Items
Single-machine scheduling problems with an actual time-dependent deterioration, Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration, Single-machine scheduling with logarithm deterioration, Scheduling jobs with truncated exponential learning functions, Optimal due-date assignment problem with learning effect and resource-dependent processing times, Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time, Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning, Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time, Single machine group scheduling with decreasing time-dependent processing times subject to release dates, A survey of scheduling problems with no-wait in process, A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times, Minimizing makespan in a two-machine flow shop with effects of deterioration and learning, Flow shop scheduling problem with position-dependent processing times
Cites Work
- Unnamed Item
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Time-dependent scheduling
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- Scheduling jobs under simple linear deterioration
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- A concise survey of scheduling with time-dependent processing times
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Encyclopedia of Optimization
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- The NP-completeness column: An ongoing guide
