Hostname: page-component-5447f9dfdb-lxcff Total loading time: 0 Render date: 2025-07-31T05:00:35.716Z Has data issue: false hasContentIssue false
  • English
  • Français

Flowshop/no-idle scheduling to minimise the mean flowtime

Published online by Cambridge University Press:  17 February 2009

Laxmi Narain  and
P. C. Bagga
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
Information
The ANZIAM Journal , Volume 47 , Issue 2 , October 2005 , pp. 265 - 275
Copyright
Copyright © Australian Mathematical Society 2005

References

[1]Adiri, I. and Pohoryles, D., “Flowshop/no-idle or no wait scheduling to minimize the sum of completion time”. Naval Res. Logist. Quart. 29 (1982) 495–504.CrossRefGoogle Scholar
[2]Aldowaisan, T. and Allahverdi, A., “Total flowtime in no-wait flowshops with separated setup times”, Comput. Oper Res. 25 (1998) 757–765.CrossRefGoogle Scholar
[3]Allahverdi, A. and Aldowaisan, T., “No-wait and separate setup three-machine flowshop with total completion time criterion”, Int. Trans. Oper Res. 7 (2000) 245–264.Google Scholar
[4]Allahverdi, A. and Aldowaisan, T., “Minimizing total completion time in a no-wait flowshop with sequence dependent additive changeover times”, J. Oper Res. Soc. 52 (2001) 449–462.CrossRefGoogle Scholar
[5]Chen, C., Neppalli, V. and Aljaber, N.. “Genetic algorithms applied to the continuous flowshop problem”. Compur. Indust. Engng. 30 (1996) 919–929.CrossRefGoogle Scholar
[6]Conway, R. W., Maxwell, W. L. and Miller, L. W., Theory of scheduling (Addison-Wesley, Massachusetts, 1967).Google Scholar
[7]Garey, M. R., Johnson, D. S. and Sethi, R., “The complexity of flowshop and jobshop scheduling”, Math. Oper Res. 1, 2 (1976) 117–129.CrossRefGoogle Scholar
[8]Hall, N. G. and Sriskandarajah, C., “A survey of machine scheduling problems with blocking and no-wait in process”, Oper. Res. 44 (1996) 510–525.CrossRefGoogle Scholar
[9]Ignall, E. and Schrage, L., “Applications of the branch-and-bound technique to some flowshop scheduling problems”, Oper. Res. 13 (1965) 400–412.CrossRefGoogle Scholar
[10]Johnson, S. M., “Optimal two and three stage production schedules with setup times included”, Naval Res. Logist. Quart. 1 (1954) 61–68.CrossRefGoogle Scholar
[11]Lawler, E. L. and Wood, D. E., “Branch and bound method: A survey”, Oper Res. 14 (1966) 699–719.CrossRefGoogle Scholar
[12]Narain, L., “Minimizing total hiring cost of machines in n × m flowshop problem”, J. Decis. Math. Sci. 7 (2002) 23–32.Google Scholar
[13]Narain, L. and Bagga, P. C., “Minimizing total elapsed time subject to zero idle time of machines in n × 3 flowshop problem”, Indian J. Pure Appl. Math. 34 (2003) 219–228.Google Scholar
[14]Rajendran, C. and Chaudhuri, D., “Heuristic algorithms for continuous flowshop problem”, Naval Res. Logist. Quart. 37 (1990) 695–705.3.0.CO;2-L>CrossRefGoogle Scholar
[15]Rinnooy-Kan, A. H. J., Machine scheduling problems: classification, complexity and computations (Nijhoff Publishing, The Hague, 1976).Google Scholar
[16]Szwarc, S., “The flowshop problem with mean completion time criterion”, AIIE Trans. 15 (1983) 172–176.Google Scholar
[17]van der Veen, J. A. A. and van Dal, R., “Solvable cases of the no-wait flowshop scheduling problem”, J. Oper Res. Soc. 42 (1991) 971–980.CrossRefGoogle Scholar