Minimizing makespan in parallel flowshops

DOI10.1057/PALGRAVE.JORS.2600408zbMATH Open0890.90110OpenAlexW1991690157MaRDI QIDQ4356676FDOQ4356676

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

Publication date: 22 June 1998

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

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

Recommendations

• Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Makespan minimization subject to flowtime optimality on identical parallel machines
• Minimizing makespan in hybrid flowshops
• Minimizing makespan subject to minimum flowtime on two identical parallel machines
• An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Minimizing flowtime subject to optimal makespan on two identical parallel machines
• Concurrent flowshop scheduling to minimize makespan.
• Minimizing the makespan in nonpreemptive parallel machine scheduling problem
• Minimizing makespan in a pallet-constrained flowshop

zbMATH Keywords

heuristicsschedulingsequencingparallel flow-shop

Mathematics Subject Classification ID

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

Cited In (12)

• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• Minimizing makespan and throughput times at Aalsmeer flower auction
• Concurrent flowshop scheduling to minimize makespan.
• Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests
• Scheduling multi-stage parallel-processor services to minimize average response time
• The hybrid flow shop scheduling problem
• Minimizing flowtime subject to optimal makespan on two identical parallel machines
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• Minimizing the makespan in nonpreemptive parallel machine scheduling problem
• Makespan minimization for parallel jobs with energy constraint
• Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Makespan minimization subject to flowtime optimality on identical parallel machines

This page was built for publication: Minimizing makespan in parallel flowshops

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