Heuristics for the Identical Machine Scheduling Problem with Preventive Maintenances

Heuristics for the Identical Machine Scheduling Problem with Preventive Maintenances

In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed pe...

Full description

Saved in:
Bibliographic Details
Published in:Shanghai jiao tong da xue xue bao Vol. 21; no. 1; pp. 112 - 120
Main Author: 江才林 陆志强 崔维伟
Format: Journal Article
Language:English
Published: Shanghai Shanghai Jiaotong University Press 01-02-2016
Subjects:
Algorithms
Architecture
Completion time
Computer Science
Electrical Engineering
Engineering
Heuristic
Life Sciences
Maintenance
Materials Science
Mathematical models
Optimization
Permissible error
Scheduling
heuristic
F 224.9
unavailability constraints
identical machine scheduling
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed periodically and the objective is to minimize the makespan. In the second model, the maintenance activities are flexible and the machines＇ continuous working time cannot exceed a maximum allowed time T; the objective is to minimize the total completion time of jobs. For the first problem, we propose a heuristic longest batch time （LBT） and prove that the worst case error bound of LBT is 2. For the second problem, we develop a heuristic modified smallest processing time （MSPT） that both of the heuristics based on some properties of the optimal solutions. Computational experiments show are effective and efficient compared with the results obtained by CPLEX and the other algorithms.
Bibliography:31-1943/U
identical machine scheduling, unavailability constraints, heuristic
JIANG Cailin, LU Zhiqiang, CUI Weiwei（1. Institute of Industrial Engineering, Tongji University, Shanghai 201804 China; 2. Department of Industrial Engineering and Logistics Management, Shanghai Jiaotong University, Shanghai 200240, China）
In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed periodically and the objective is to minimize the makespan. In the second model, the maintenance activities are flexible and the machines＇ continuous working time cannot exceed a maximum allowed time T; the objective is to minimize the total completion time of jobs. For the first problem, we propose a heuristic longest batch time （LBT） and prove that the worst case error bound of LBT is 2. For the second problem, we develop a heuristic modified smallest processing time （MSPT） that both of the heuristics based on some properties of the optimal solutions. Computational experiments show are effective and efficient compared with the results obtained by CPLEX and the other algorithms.
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1007-1172
1995-8188
DOI:10.1007/s12204-015-1690-z