Minimizing total elapsed time subject to zero total idle time of machines in \(n\times 3\) flowshop problem.

zbMath1053.90049MaRDI QIDQ1396238

P. C. Bagga, Laxmi Narain

Publication date: 23 October 2003

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Stochastic scheduling theory in operations research (90B36)

Related Items (2)

Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

This page was built for publication: Minimizing total elapsed time subject to zero total idle time of machines in \(n\times 3\) flowshop problem.