An efficient bicriteria algorithm for stable robotic flow shop scheduling

• Published in: European journal of operational research Vol. 260; no. 3; pp. 964 - 971
• Main Authors: Che, Ada, Kats, Vladimir, Levner, Eugene
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.08.2017
• Subjects: Cyclic scheduling; Parametric critical path algorithm; Robotic flow shop scheduling; Scheduling; Stability analysis; Scheduling; Stability analysis; Robotic flow shop scheduling; Cyclic scheduling; Parametric critical path algorithm
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2017.01.033

•We consider stable robotic scheduling with interval times and a fixed robot route.•We minimize the cycle time and maximize the stability radius simultaneously.•We propose a strongly polynomial algorithm to find the Pareto front. We consider a flow shop for processing single type of parts serviced by a single robot. The robot transportation times are allowed to have small perturbations. We treat the robotic flow shop scheduling problem considering stability of its schedule where the robot route is fixed and the processing durations of parts are to be specified from given intervals. The stability radius of a schedule is defined as the largest quantity of variations in the transportation times within which the schedule can still be executed as expected. We consider the bicriteria optimization problem which consists of minimizing the cycle time and maximizing the stability radius. The objective is to handle the two criteria simultaneously, that is, to find their Pareto front. We propose a new strongly polynomial algorithm for finding the minimum cycle times for all possible values of stability radius with time complexity of O(m4), where m is the number of processing machines in the flow shop. This implies that we can find the entire Pareto front of the problem in O(m4) time.