Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T03:24:38.681Z Has data issue: false hasContentIssue false

Flowshop/no-idle scheduling to minimise the mean flowtime

Published online by Cambridge University Press:  17 February 2009

Laxmi Narain
Affiliation:
Department of Mathematics, University of Delhi, Delhi, India; e-mail: laxmi_narain_2004@yahoo.com.
P. C. Bagga
Affiliation:
First line of address, Second line of address, etc.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2005