Optimal four-machine flow shop scheduling with dominance condition

DOI10.1080/09720510.2007.10701244zbMATH Open1134.90014OpenAlexW2069230179MaRDI QIDQ5454979FDOQ5454979

Authors: Weining Chen 

Publication date: 3 April 2008

Published in: Journal of Statistics and Management Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720510.2007.10701244

Recommendations

• Flowshop scheduling with dominant machines
• Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan
• Flow shop scheduling problems with time-dependent processing times on dominated machines
• Nonpreemptive flowshop scheduling with machine dominance
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines
• OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP
• Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
• Flow shop scheduling problems under machine-dependent precedence constraints
• Open-shop scheduling problems with dominated machines

zbMATH Keywords

optimal solutionflow shopscheduling algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Optimal four-machine flow shop scheduling with dominance condition

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