51视频

Computer Science and Information Technology Vol. 7(4), pp. 103 - 110
DOI: 10.13189/csit.2019.070401
Reprint (PDF) (655Kb)


Bi-objective Optimization Model for Integrated Preventive Maintenance and Flexible Job-shop Scheduling Problem


Javad Rezaeian 1,*, Farzaneh Mohammadpour 2
1 Department of Industrial Engineering, Mazandaran University of Science and Technology, Iran
2 Industrial Management Institute, Iran

ABSTRACT

This paper develops an integrated model for flexible job-shop scheduling problem with the maintenance activities. Reliability models are used to perform the maintenance activities. This model involves two objectives: minimization of the maximum completion time for flexible job-shop production part and minimization of system unavailability for the PM (preventive maintenance) part. To aim the objectives, two decisions must be taken at the same time: assigning n jobs on m machines in order to minimize the maximum completion time and finding the appropriate times to perform PM activities to minimize the system unavailability. These objectives are obtained with considering dependent machine setup times for operations and release times for jobs. In advance, the maintenance activity numbers and PM intervals are not fixed. Two multi objective optimization methods are compared to find the pareto-optimal front in the flexible job-shop problem case. Promising the obtained results, a benchmark with a large number of test instances is employed.

KEYWORDS
Job-shop Scheduling, Preventive Maintenance, Bi-objective

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Javad Rezaeian , Farzaneh Mohammadpour , "Bi-objective Optimization Model for Integrated Preventive Maintenance and Flexible Job-shop Scheduling Problem," Computer Science and Information Technology, Vol. 7, No. 4, pp. 103 - 110, 2019. DOI: 10.13189/csit.2019.070401.

(b). APA Format:
Javad Rezaeian , Farzaneh Mohammadpour (2019). Bi-objective Optimization Model for Integrated Preventive Maintenance and Flexible Job-shop Scheduling Problem. Computer Science and Information Technology, 7(4), 103 - 110. DOI: 10.13189/csit.2019.070401.