Title: Optimal cyclic scheduling of a robotic flowshop with multiple part types and flexible processing times

Authors: Weidong Lei; Ada Che; Chengbin Chu

Addresses: School of Management, Northwestern Polytechnical University, Xi'an 710072, China ' School of Management, Northwestern Polytechnical University, Xi'an 710072, China ' Labortoire Génie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92295, Châtenay-Malabry Cedex, France

Abstract: This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic flowshop with multiple part types in which the processing times of parts can vary within their given time windows. The problem consists of two types of sequencing issues: part input sequencing and robot move sequencing. We give a formulation for the problem and propose a branch-and-bound algorithm based on the properties of the developed model. The proposed branch-and-bound algorithm consists of three nested procedures, called procedures A, B and C, respectively. Procedures A and B are mainly designed for enumerating part input sequences, while procedure C is responsible for numerating robot move sequences. To reduce the solution space and speed up the algorithm, we derive the upper bound of the number of parts that can be serviced by the robot within a cycle. Computational results on both benchmark and randomly generated instances are reported. [Received 19 August 2011; Revised 16 February 2012; Revised 29 June 2012; Accepted 22 July 2012]

Keywords: cyclic hoist scheduling; robotic flowshops; minimal part set; MPS; branch-and-bound algorithm; flexible processing times; optimisation; cyclic scheduling; multiple part types; part input sequencing; robot move sequencing; robot motion; robot materials handling.

DOI: 10.1504/EJIE.2014.060434

European Journal of Industrial Engineering, 2014 Vol.8 No.2, pp.143 - 167

Published online: 28 Jun 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article