A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem
This paper proposes a novel two-level metaheuristic algorithm, consisting of an upper-level algorithm and a lower-level algorithm, for the job-shop scheduling problem (JSP). The upper-level algorithm is a novel population-based algorithm developed to be a parameter controller for the lower-level alg...
Saved in:
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2019/8683472 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832549291985469440 |
---|---|
author | Pisut Pongchairerks |
author_facet | Pisut Pongchairerks |
author_sort | Pisut Pongchairerks |
collection | DOAJ |
description | This paper proposes a novel two-level metaheuristic algorithm, consisting of an upper-level algorithm and a lower-level algorithm, for the job-shop scheduling problem (JSP). The upper-level algorithm is a novel population-based algorithm developed to be a parameter controller for the lower-level algorithm, while the lower-level algorithm is a local search algorithm searching for an optimal schedule in the solution space of parameterized-active schedules. The lower-level algorithm’s parameters controlled by the upper-level algorithm consist of the maximum allowed length of idle time, the scheduling direction, the perturbation method to generate an initial solution, and the neighborhood structure. The proposed two-level metaheuristic algorithm, as the combination of the upper-level algorithm and the lower-level algorithm, thus can adapt itself for every single JSP instance. |
format | Article |
id | doaj-art-1fecb1ffc259438f9676ac7aa0da0143 |
institution | Kabale University |
issn | 1076-2787 1099-0526 |
language | English |
publishDate | 2019-01-01 |
publisher | Wiley |
record_format | Article |
series | Complexity |
spelling | doaj-art-1fecb1ffc259438f9676ac7aa0da01432025-02-03T06:11:32ZengWileyComplexity1076-27871099-05262019-01-01201910.1155/2019/86834728683472A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling ProblemPisut Pongchairerks0Industrial Engineering Program, Faculty of Engineering, Thai-Nichi Institute of Technology, Bangkok 10250, ThailandThis paper proposes a novel two-level metaheuristic algorithm, consisting of an upper-level algorithm and a lower-level algorithm, for the job-shop scheduling problem (JSP). The upper-level algorithm is a novel population-based algorithm developed to be a parameter controller for the lower-level algorithm, while the lower-level algorithm is a local search algorithm searching for an optimal schedule in the solution space of parameterized-active schedules. The lower-level algorithm’s parameters controlled by the upper-level algorithm consist of the maximum allowed length of idle time, the scheduling direction, the perturbation method to generate an initial solution, and the neighborhood structure. The proposed two-level metaheuristic algorithm, as the combination of the upper-level algorithm and the lower-level algorithm, thus can adapt itself for every single JSP instance.http://dx.doi.org/10.1155/2019/8683472 |
spellingShingle | Pisut Pongchairerks A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem Complexity |
title | A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem |
title_full | A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem |
title_fullStr | A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem |
title_full_unstemmed | A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem |
title_short | A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem |
title_sort | two level metaheuristic algorithm for the job shop scheduling problem |
url | http://dx.doi.org/10.1155/2019/8683472 |
work_keys_str_mv | AT pisutpongchairerks atwolevelmetaheuristicalgorithmforthejobshopschedulingproblem AT pisutpongchairerks twolevelmetaheuristicalgorithmforthejobshopschedulingproblem |