Abstract The cyclic scheduling problem of n jobs on m identical parallel machines that can be represented by P I cyc, sds I Cmax, from a practical view this problem is extremely important to the production of any product that needs machine preparing operations, as they pass from one job to the other, such as: cleaning piece, tool and drawing changing. A heuristic method was developed in order to find P I cyc, sds I Cmax solution, trying to minimize the maximum cycle completion time and to balance the load among the machines after finish all cycles. After the analysis and the validation of the empiric results, it was developed a caIculum, in order to get an estimate of the algorithm total complexity order.
[1]
Michel Gendreau,et al.
A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times
,
1996
.
[2]
Ellis Horowitz,et al.
Fundamentals of Computer Algorithms
,
1978
.
[3]
E.L. Lawler,et al.
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
,
1977
.
[4]
Gilbert Laporte,et al.
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
,
1992,
Oper. Res..
[5]
A. J. Clewett,et al.
Introduction to sequencing and scheduling
,
1974
.