A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
From MaRDI portal
Publication:2379563
DOI10.1016/j.ejor.2008.12.029zbMath1183.90192OpenAlexW2142388987MaRDI QIDQ2379563
Kai Cui, Ji-Bo Wang, Lin-Yan Sun, Lin-Hui Sun
Publication date: 19 March 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.12.029
Related Items
Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ Two-machine flow shop total tardiness scheduling problem with deteriorating jobs ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ Considerations of single-machine scheduling with deteriorating jobs ⋮ Some single-machine and flowshop scheduling problems with a non-linear deterioration function ⋮ Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- A concise survey of scheduling with time-dependent processing times
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Scheduling with time dependent processing times: Review and extensions
- Flow shop scheduling problems with deteriorating jobs under dominating machines
