Makespan minimization in machine dominated flowshop

DOI10.1016/j.amc.2010.05.022zbMath1230.90088OpenAlexW1999018784MaRDI QIDQ708144

Larry E. Parten, Rafael Moras, Paul X. Uhlig, Gopalakrishnan Easwaran

Publication date: 11 October 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.05.022

zbMATH Keywords

schedulingcombinatorial optimizationmakespanflowshopmachine dominance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ Reducing network and computation complexities in neural based real-time scheduling scheme ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects

Cites Work

• Makespan distribution of permutation flowshop schedules
• Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines
• A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
• Erratum to: ``A note on flow shop scheduling problems with a learning effect on no-idle dominant machines by M. Cheng et al.
• Flow-shops with a dominant machine
• Flowshop scheduling with dominant machines
• Nonpreemptive flowshop scheduling with machine dominance
• No-wait or no-idle permutation flowshop scheduling with dominating machines
• Optimal two- and three-stage production schedules with setup times included
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Scheduling

This page was built for publication: Makespan minimization in machine dominated flowshop