Flowshop/no-idle scheduling to minimise the mean flowtime

• Autores: P. C. Bagga, L. Narain
• Localización: Anziam journal: The Australian & New Zealand industrial and applied mahtematics journal, ISSN 1446-1811, Vol. 47, Nº 2, 2005, págs. 265-276
• Idioma: inglés
• DOI: 10.1017/s1446181100010026
• Texto completo no disponible (Saber más ...)
• Resumen

  • This paper deals with n-job, 2-machine flowshop/mean flowtime scheduling problems working under a "no-idle" constraint, that is, when machines work continuously without idle intervals. A branch and bound technique has been developed to solve the problem.