MSPT2 Heuristic and Dynamic Programming Method for the Parallel Machine Scheduling Problem with scheduled Preventive Maintenance

Author

Mellouli, Racem ; Sadfi, Chérif ; Chu, Chengbin ; Kacem, Imed

Author_Institution

Inst. Charles Delaunay ICD, Univ. of Technol. of Troyes

Volume

2

fYear

2006

Firstpage

1264

Lastpage

1270

Abstract

In this paper, we consider the parallel-machine scheduling problem with scheduled maintenance periods to minimize the total (non-weighted and weighted) completion time. For the case of single maintenance period on each machine, we provide an adapted definition of the "SPT" algorithm and we propose an MSPT2 heuristic. For the general case, we present a dynamic programming model to solve optimally the problem. In addition, improved dominance properties are proposed. Experimental simulations are done to evaluate the method performances

Keywords

computational complexity; dynamic programming; job shop scheduling; minimisation; parallel machines; preventive maintenance; MSPT2 heuristic; SPT algorithm; dynamic programming method; parallel machine scheduling problem; scheduled preventive maintenance; total completion time minimization; Availability; Dynamic programming; Dynamic scheduling; Electric breakdown; Job shop scheduling; Machinery production industries; Parallel machines; Performance evaluation; Preventive maintenance; Scheduling algorithm; Availability Constraint Parallel Machines; Scheduling Problem; Total Completion Time;

fLanguage

English

Publisher

ieee

Conference_Titel

Service Systems and Service Management, 2006 International Conference on

Conference_Location

Troyes

Print_ISBN

1-4244-0450-9

Electronic_ISBN

1-4244-0451-7

Type

conf

DOI

10.1109/ICSSSM.2006.320690

Filename

4114672