Minimizing makespan in parallel flowshops

DOI10.1057/palgrave.jors.2600408zbMath0890.90110OpenAlexW1991690157MaRDI QIDQ4356676

I. Viswanathan, P. S. Sundararaghavan, Anand S. Kunnathur

Publication date: 22 June 1998

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600408

zbMATH Keywords

heuristicsschedulingsequencingparallel flow-shop

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications ⋮ The hybrid flow shop scheduling problem ⋮ Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests