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

Abstract

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.

An adaptive neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop

“…This has been studied by many researchers; among them include those investigated by Zandieh et al (2006), Desprez et al (2009), Mirsane et al (2009 and Luo et al (2010). flexible flow line.…”

Allocation improvement policies to reduce process time based on workload evaluation in job shop manufacturing systems

“…Some recent papers studied the problem of controllable processing time for flow-shop scheduling problem (Mokhtari et al, 2011;Uruk et al, 2013). A real industrial application is implemented for Gienow Windows and Doors Ltd. Based on the optimal resource allocation for hybrid flow shop in oneof-a-kind production to achieve an optimal resource allocation plan ensuring that all jobs are finished in a given time interval (Luo et al, 2010).…”