Scheduling a flow-shop with combined buffer conditions

Liu, Shi Qiang & Kozan, Erhan (2009) Scheduling a flow-shop with combined buffer conditions. International Journal of Production Economics, 117(2), pp. 371-380.

View at publisher


In this paper, No-Wait, No-Buffer, Limited-Buffer, and Infinite-Buffer conditions for the flow-shop problem (FSP) have been investigated. These four different buffer conditions have been combined to generate a new class of scheduling problem, which is significant for modelling many real-world scheduling problems. A new heuristic algorithm is developed to solve this strongly NP-hard problem. Detailed numerical implementations have been analysed and promising results have been achieved.

Impact and interest:

19 citations in Scopus
11 citations in Web of Science®
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 48674
Item Type: Journal Article
Refereed: Yes
Additional URLs:
Keywords: Scheduling, Flow shop, Blocking, No-wait, Limited-buffer, Combined-buffer
DOI: 10.1016/j.ijpe.2008.11.007
ISSN: 0925-5273
Divisions: Current > Schools > School of Mathematical Sciences
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2008 Elsevier B.V.
Deposited On: 16 Feb 2012 21:27
Last Modified: 28 Feb 2012 03:10

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page