In a one-of-a-kind production (OKP) company, the operation routing and processing time of an order are usually different from the others due to high customisation. As a result, an OKP company needs to dynamically adjust the production resources to keep the production lines reconfigurable. Through a proper assignment of operators in different sections of a production line, bottlenecks and operator
... [Show full abstract] re-allocation during production can be reduced effectively. In this paper, a mathematical model is introduced for optimal operator allocation planning on a reconfigurable production line in OKP. The optimisation objectives are to minimise the total number of the operators, total job earliness and tardiness, and the average work-in-process storage. A branch-and-bound algorithm with efficient pruning strategies is developed to solve this problem. The proposed model and the algorithm are empirically validated by using the data of a windows and doors manufacturing company. A software system based on the proposed approach has been implemented in the company.
