Robust algorithm for the uncertain scheduling problem with moving executors

Author:	Jozefczyk Jerzy, Wroclaw University of Technology, Poland
Topic:	5.2 Manufacturing Modelling for Management and Control
Session:	Production Planning and Scheduling - II
Keywords:	flexible manufacturing systems, scheduling, movement, decision making, uncertainty, robustness, optimization problems

Abstract

In the paper the combined routing-scheduling problem which consists in scheduling of tasks on moving executors is considered. The case with non-preemptive and independent tasks, unrelated executors as well as interval processing times to minimize the maximum lateness is investigated. The robust scheduling problem based on the modified relative regret function is formulated. The solution algorithm uses the result which allows to reduce an uncertain problem to a number of deterministic problems. Then the uncertain problem considered can be solved by a deterministic algorithm. The simple numerical example is given.