The time varying cyclic job shop problem

Abstract : In classical scheduling, a set of tasks is executed once while the determined schedule optimizes objective functions such as the makespan or earliness-tardiness. In contrast, cyclic scheduling means performing a set of generic tasks infinitely often while minimizing the time between two occurrences of the same task.Cyclic scheduling has several applications, e.g. in robotic industry, in manufacturing systems or multiprocessor computing. It has been studied from multiple perspectives, since there exist several possible representations of the problem such as graph theory, mixed integer linear programming, Petri nets or (max, +) algebra. An overview about cyclic scheduling problems and the different approaches can be found in [Hanen and Munier, 1995a] and [Brucker and Kampmeyer, 2008]. However, few works have tackled the robust version of this problem although the literature for robust classical scheduling problem is large. In this paper, we consider a subset of tasks that have variable processing times. Besides, the minimum processing time and the maximum processing time of these tasks are known. We propose a method that finds the schedule which minimizes the expected cycle time. We show that the evaluation of a schedule can be considered as a volume calculus of polyhedron. More precisely, for each schedule we derive a set of polyhedron and the integral calculus (based on the Vinci library [Bueler et al., 2000]) of their volume leads to an evaluation of the performance of the considered schedule. This approach enables to derive a branch and bound procedure to choose the best schedule in the sense of the smallest cycle time with respect to the variability of the processing times.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download
Contributor : Laurent Houssin <>
Submitted on : Tuesday, June 21, 2016 - 5:41:06 PM
Last modification on : Friday, January 10, 2020 - 9:10:16 PM


Files produced by the author(s)


  • HAL Id : hal-01335143, version 1


Laurent Houssin, Idir Hamaz, Sonia Cafieri. The time varying cyclic job shop problem. International Conference on Project Management and Scheduling (PMS), Apr 2016, Valencia, Spain. 4p. ⟨hal-01335143⟩



Record views


Files downloads