Optimal resource allocation for hybrid flow shop in one-of-a-kind production

Xinggang Luo, Wei Li, Deyi Xue, Jiafu Tang, Yiliu Tu

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


In one-of-a-kind production (OKP) companies, the number of production resources in each work centre of a production line is flexible in shifts because the resource demands of customer orders are always different from shift to shift. In this paper an optimisation model is established to achieve an optimal resource allocation plan ensuring that all jobs are finished in a given time interval with a minimum number of resources and without any buffer overflow. A branch-and-bound algorithm is developed to solve the problem. Two theorems are proved and applied in the algorithm to improve its pruning efficiency. A real industrial application is implemented for Gienow Windows and Doors Ltd. based on this model and algorithm. Experimental results show that this method is effective.

Original languageEnglish
Pages (from-to)146-154
Number of pages9
JournalInternational Journal of Computer Integrated Manufacturing
Issue number2
StatePublished - Feb 2010

Bibliographical note

Funding Information:
This research is financially supported by the NSERC (Natural Sciences and Engineering Research Council) of Canada Strategic Program grant, NSERC Discovery grant, and the National Science Foundation of China (NSFC Proj. 70871020, 70721001 and 70625001).


  • Branch-and-bound
  • Hybrid flow shop
  • One-of-a-kind production (OKP)
  • Resource allocation

ASJC Scopus subject areas

  • Mechanical Engineering
  • Computer Science Applications
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Optimal resource allocation for hybrid flow shop in one-of-a-kind production'. Together they form a unique fingerprint.

Cite this