Integrating the sequence dependent setup time open shop problem and preventive maintenance policies
In most industrial environments, it is usually considered that machines are accessible throughout the planning horizon, but in real situation, machines may be unavailable due to a scheduled preventive maintenance where the periods of unavailability are known in advance. The main idea of this paper...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2016-09-01
|
Series: | Decision Science Letters |
Subjects: | |
Online Access: | http://www.growingscience.com/dsl/Vol5/dsl_2016_12.pdf |
id |
doaj-a0565f4dde134251954205f97b124b2b |
---|---|
record_format |
Article |
spelling |
doaj-a0565f4dde134251954205f97b124b2b2020-11-24T23:08:24ZengGrowing ScienceDecision Science Letters1929-58041929-58122016-09-015453555010.5267/j.dsl.2016.4.002Integrating the sequence dependent setup time open shop problem and preventive maintenance policiesK. NabourehE. Safari In most industrial environments, it is usually considered that machines are accessible throughout the planning horizon, but in real situation, machines may be unavailable due to a scheduled preventive maintenance where the periods of unavailability are known in advance. The main idea of this paper is to consider different preventive maintenance policies on machines regarding open shop scheduling problem (OSSP) with sequence dependent setup times (SDST) using immune algorithm. The preventive maintenance (PM) policies are planned for maximizing availability of machines or keeping minimum level of reliability through the production horizon. The objective function of the paper is to minimize makespan. In total, the proposed algorithm extensively is compared with six adaptations of existing heuristic and meta-heuristic methods for the problem through data sets from benchmarks based on Taillard’s instances with some adjustments. The results show that the proposed algorithm outperforms other algorithms for this problem.http://www.growingscience.com/dsl/Vol5/dsl_2016_12.pdfOpen shopMeta heuristicsPreventive maintenanceSDSTImmune Algorithm |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
K. Naboureh E. Safari |
spellingShingle |
K. Naboureh E. Safari Integrating the sequence dependent setup time open shop problem and preventive maintenance policies Decision Science Letters Open shop Meta heuristics Preventive maintenance SDST Immune Algorithm |
author_facet |
K. Naboureh E. Safari |
author_sort |
K. Naboureh |
title |
Integrating the sequence dependent setup time open shop problem and preventive maintenance policies |
title_short |
Integrating the sequence dependent setup time open shop problem and preventive maintenance policies |
title_full |
Integrating the sequence dependent setup time open shop problem and preventive maintenance policies |
title_fullStr |
Integrating the sequence dependent setup time open shop problem and preventive maintenance policies |
title_full_unstemmed |
Integrating the sequence dependent setup time open shop problem and preventive maintenance policies |
title_sort |
integrating the sequence dependent setup time open shop problem and preventive maintenance policies |
publisher |
Growing Science |
series |
Decision Science Letters |
issn |
1929-5804 1929-5812 |
publishDate |
2016-09-01 |
description |
In most industrial environments, it is usually considered that machines are accessible throughout the planning horizon, but in real situation, machines may be unavailable due to a scheduled preventive maintenance where the periods of unavailability are known in advance. The main idea of this paper is to consider different preventive maintenance policies on machines regarding open shop scheduling problem (OSSP) with sequence dependent setup times (SDST) using immune algorithm. The preventive maintenance (PM) policies are planned for maximizing availability of machines or keeping minimum level of reliability through the production horizon. The objective function of the paper is to minimize makespan. In total, the proposed algorithm extensively is compared with six adaptations of existing heuristic and meta-heuristic methods for the problem through data sets from benchmarks based on Taillard’s instances with some adjustments. The results show that the proposed algorithm outperforms other algorithms for this problem. |
topic |
Open shop Meta heuristics Preventive maintenance SDST Immune Algorithm |
url |
http://www.growingscience.com/dsl/Vol5/dsl_2016_12.pdf |
work_keys_str_mv |
AT knaboureh integratingthesequencedependentsetuptimeopenshopproblemandpreventivemaintenancepolicies AT esafari integratingthesequencedependentsetuptimeopenshopproblemandpreventivemaintenancepolicies |
_version_ |
1725614428052783104 |