A note on flow shop scheduling problems with a learning effect on no-idle dominant machines

DOI10.1016/J.AMC.2006.05.206zbMATH Open1143.90011OpenAlexW2018998564MaRDI QIDQ879575FDOQ879575

Authors: 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

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

zbMATH Keywords

algorithmschedulinglearning effectpermutation flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single-machine scheduling with learning considerations
• Scheduling with general job-dependent learning curves.
• Scheduling jobs with position-dependent processing times
• Scheduling problems with a learning effect
• Some results of the worst-case analysis for flow shop scheduling
• 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
• Flowshop scheduling with dominant machines
• Flow-shops with a dominant machine
• Nonpreemptive flowshop scheduling with machine dominance

Cited In (21)

• Some scheduling problems with general position-dependent and time-dependent learning effects
• Some scheduling problems with time-dependent learning effect and deteriorating jobs
• Makespan minimization in machine dominated flowshop
• Minimizing total idle energy consumption in the permutation flow shop scheduling problem
• Group scheduling with learning effect and random processing time
• A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
• Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs
• Note: On the two-machine no-idle flowshop problem
• Single-machine scheduling problems with a sum-of-processing-time-based learning function
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations
• A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• Dominance conditions determination based on machine idle times for the permutation flowshop 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.
• Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• A state-of-the-art review on scheduling with learning effects
• Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
• Machine scheduling problems with a general learning effect
• No-wait or no-idle permutation flowshop scheduling with dominating machines
• A systematic literature review on no-idle flow shop scheduling problem

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)