ANZIAM J.
47 (2005), 265-275
|
Flowshop/no-idle scheduling to minimise the mean flowtime
|
|
|
|
P. C. Bagga
Department of Mathematics
University of Delhi
Delhi
India
|
|
|
Abstract
|
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.
|
Download the article in PDF format (size 75 Kb)
|
|
|
Australian Mathematical Publishing Association Inc.
|
©
Australian MS
|
|