Single machine scheduling with sum-of-logarithm-processing-times based deterioration
From MaRDI portal
Publication:726391
DOI10.1016/j.ins.2014.03.004zbMath1341.90058OpenAlexW2056219263MaRDI QIDQ726391
Ping Ji, Ji-Bo Wang, Na Yin, Li-ying Kang
Publication date: 8 July 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.03.004
Related Items (6)
Research on delivery times scheduling with truncated learning effects ⋮ Research on scheduling problems with general effects of deterioration and learning ⋮ Machine scheduling problems with a position-dependent deterioration ⋮ Scheduling jobs with position and sum-of-processing-time based processing times ⋮ Single-machine scheduling problems with precedence constraints and simple linear deterioration ⋮ Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects
Cites Work
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- 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
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Minimizing Variation of Flow Time in Single Machine Systems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
This page was built for publication: Single machine scheduling with sum-of-logarithm-processing-times based deterioration
