Makespan minimization in machine dominated flowshop

DOI10.1016/J.AMC.2010.05.022zbMATH Open1230.90088OpenAlexW1999018784MaRDI QIDQ708144FDOQ708144

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

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

Recommendations

• Nonpreemptive flowshop scheduling with machine dominance
• Flowshop scheduling with dominant machines
• The two-machine sequence dependent flowshop scheduling problem
• scientific article; zbMATH DE number 2186529
• Minimizing makespan in an ordered flow shop with machine-dependent processing times

zbMATH Keywords

combinatorial optimizationschedulingmakespanflowshopmachine dominance

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Minimizing makespan in an ordered flow shop with machine-dependent processing times
• Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations
• Reducing network and computation complexities in neural based real-time scheduling scheme
• Makespan minimization for flow-shop problems with transportation times and a single robot
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• Nonpreemptive flowshop scheduling with machine dominance
• Flowshop scheduling with dominant machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708144)