A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
From MaRDI portal
Publication:879575
DOI10.1016/j.amc.2006.05.206zbMath1143.90011OpenAlexW2018998564MaRDI QIDQ879575
Mingbao Cheng, Shijie Sun, Ying Yu
Publication date: 14 May 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.206
Related Items (16)
Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ Some scheduling problems with general position-dependent and time-dependent learning effects ⋮ Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem ⋮ Single-machine scheduling problems with a sum-of-processing-time-based learning function ⋮ Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ A systematic literature review on no-idle flow shop scheduling problem ⋮ Erratum to: ``A note on flow shop scheduling problems with a learning effect on no-idle dominant machines by M. Cheng et al. ⋮ Group scheduling with learning effect and random processing time ⋮ A state-of-the-art review on scheduling with learning effects ⋮ Makespan minimization in machine dominated flowshop ⋮ Machine scheduling problems with a general learning effect ⋮ Some scheduling problems with time-dependent learning effect and deteriorating jobs ⋮ Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect ⋮ A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect ⋮ Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
Cites Work
- Single-machine scheduling with learning considerations
- Flow-shops with a dominant machine
- Some results of the worst-case analysis for flow shop scheduling
- Flowshop scheduling with dominant machines
- Nonpreemptive flowshop scheduling with machine dominance
- Scheduling with general job-dependent learning curves.
- A makespan study of the two-machine flowshop scheduling problem with a learning effect
- Flow-shop scheduling with a learning effect
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling jobs with position-dependent processing times
- Scheduling problems with a learning effect
This page was built for publication: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
