Research Article | OPEN ACCESS
An Effective Meta-heuristic Algorithm for Solving Multi-criteria Job-shop Scheduling Problem with Maintenance Activities
1Younes Bahmani, 1Hacene Smadi, 2Fatima Ghedjati and 1Messaoud Benzouai
1Laboratory of Automation and Manufacturing, Batna University, Algeria
2Laboratory of CReSTIC, Reims Champagne-Ardenne University, France
Research Journal of Applied Sciences, Engineering and Technology ` 2015 9:950-961
Received: March 19, 2015 | Accepted: May 22, 2015 | Published: November 25, 2015
Abstract
In this study, a metaheuristic based on the Non-dominated Sorting Genetic Algorithm type II (NSGA-II) is proposed to solve the Multi-Criterions Job Shop Scheduling Problem (MCJSSP) under resources availability constraints. Availability periods and starting time of maintenance activities are supposed to be flexible. The MCJSSP requires, simultaneous minimization several antagonistic criteria, such as the maximum completion time of all jobs (Makespan), production cost and maintenance cost. To validate the proposed approach we tested it on forty-four instances references. The results show that our approach is experimentally promising to solve practical problems.
Keywords:
Availability , job-shop scheduling, metaheuristic, multi-criteria optimization, Taguchi,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
