A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
From MaRDI portal
(Redirected from Publication:879575)
Recommendations
- Erratum to: ``A note on flow shop scheduling problems with a learning effect on no-idle dominant machines by M. Cheng et al.
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- Note on ``Single-machine and flowshop scheduling with a general learning effect model and ``Some single-machine and m-machine flowshop scheduling problems with learning considerations
- Flow-shop scheduling of two machines with learning effect
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Flow-shop scheduling with a learning effect
- No-wait flexible flowshop scheduling with no-idle machines
Cites work
- A makespan study of the two-machine flowshop scheduling problem with a learning effect
- Flow-shop scheduling with a learning effect
- Flow-shops with a dominant machine
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Flowshop scheduling with dominant machines
- Nonpreemptive flowshop scheduling with machine dominance
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling jobs with position-dependent processing times
- Scheduling problems with a learning effect
- Scheduling with general job-dependent learning curves.
- Single-machine scheduling with learning considerations
- Some results of the worst-case analysis for flow shop scheduling
Cited in
(21)- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Some scheduling problems with time-dependent learning effect and deteriorating jobs
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- A state-of-the-art review on scheduling with learning effects
- Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs
- Makespan minimization in machine dominated flowshop
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Single-machine scheduling problems with a sum-of-processing-time-based learning function
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- 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 systematic literature review on no-idle flow shop scheduling problem
- Note: On the two-machine no-idle flowshop problem
- Minimizing total idle energy consumption in the permutation flow shop scheduling problem
- Machine scheduling problems with a general learning effect
This page was built for publication: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879575)
