An Efficient Heuristic Algorithm for Flexible Job Shop Scheduling with Maintenance Constraints

Mohsen Ziaee, University of Bojnord, Iran

Abstract

This paper deals with the flexible job shop scheduling problem with the preventive maintenance constraints where the objectives are to minimize the overall completion time (makespan), the total workload of machines and the workload of the most loaded machine. A fast heuristic algorithm based on a constructive procedure is developed to solve the problem in very short time. The algorithm is tested on the benchmark instances from the literature in order to evaluate its performance. Computational results show that, the proposed heuristic method is computationally efficient and promising for practical problems.

Keywords

Scheduling, Multi-Objective Flexible Job Shop, Preventive Maintenance, Heuristic, Local Search.

Original Source URL: https://airccse.com/mathsj/papers/1114mathsj02.pdf

https://airccse.com/mathsj/vol1.html

========================================

Submission Deadline : July 09, 2022

Here's where you can reach us : mathsj@airccse.com