Single-machine scheduling problems with actual time-dependent and job-dependent learning effect
From MaRDI portal
Publication:2253624
DOI10.1016/J.EJOR.2012.12.007zbMath1292.90117OpenAlexW2071499240MaRDI QIDQ2253624
Fangfang Chen, Huiyan Kang, Zhongyi Jiang
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.12.007
Related Items (9)
A survey on scheduling problems with due windows ⋮ An alternative approach for proving the NP-hardness of optimization problems ⋮ A short note on ``A note on single-machine scheduling with job-dependent learning effects ⋮ Flowshop scheduling problems with a position-dependent exponential learning effect ⋮ Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects ⋮ Scheduling jobs with position and sum-of-processing-time based processing times ⋮ Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm ⋮ Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect ⋮ A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects
This page was built for publication: Single-machine scheduling problems with actual time-dependent and job-dependent learning effect
