A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose Machines
This paper proposes a two-level metaheuristic consisting of lower- and upper-level algorithms for the job-shop scheduling problem with multipurpose machines. The lower-level algorithm is a local search algorithm used for finding an optimal solution. The upper-level algorithm is a population-based me...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2022/3487355 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832562417450614784 |
|---|---|
| author | Pisut Pongchairerks |
| author_facet | Pisut Pongchairerks |
| author_sort | Pisut Pongchairerks |
| collection | DOAJ |
| description | This paper proposes a two-level metaheuristic consisting of lower- and upper-level algorithms for the job-shop scheduling problem with multipurpose machines. The lower-level algorithm is a local search algorithm used for finding an optimal solution. The upper-level algorithm is a population-based metaheuristic used to control the lower-level algorithm’s input parameters. With the upper-level algorithm, the lower-level algorithm can reach its best performance on every problem instance. Most changes of the proposed two-level metaheuristic from its original variants are in the lower-level algorithm. A main purpose of these changes is to increase diversity into solution neighborhood structures. One of the changes is that the neighbor operators of the proposed lower-level algorithm are developed to be more adjustable. Another change is that the roulette-wheel technique is applied for selecting a neighbor operator and for generating a perturbation operator. In addition, the proposed lower-level algorithm uses an adjustable delay-time limit to select an optional machine for each operation. The performance of the proposed two-level metaheuristic was evaluated on well-known benchmark instances. The evaluation’s results indicated that the proposed two-level metaheuristic performs well on most benchmark instances. |
| format | Article |
| id | doaj-art-8df2fd7681b449dfb666c38ba69b81d0 |
| institution | Kabale University |
| issn | 1099-0526 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-8df2fd7681b449dfb666c38ba69b81d02025-02-03T01:22:43ZengWileyComplexity1099-05262022-01-01202210.1155/2022/3487355A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose MachinesPisut Pongchairerks0Thai-Nichi International CollegeThis paper proposes a two-level metaheuristic consisting of lower- and upper-level algorithms for the job-shop scheduling problem with multipurpose machines. The lower-level algorithm is a local search algorithm used for finding an optimal solution. The upper-level algorithm is a population-based metaheuristic used to control the lower-level algorithm’s input parameters. With the upper-level algorithm, the lower-level algorithm can reach its best performance on every problem instance. Most changes of the proposed two-level metaheuristic from its original variants are in the lower-level algorithm. A main purpose of these changes is to increase diversity into solution neighborhood structures. One of the changes is that the neighbor operators of the proposed lower-level algorithm are developed to be more adjustable. Another change is that the roulette-wheel technique is applied for selecting a neighbor operator and for generating a perturbation operator. In addition, the proposed lower-level algorithm uses an adjustable delay-time limit to select an optional machine for each operation. The performance of the proposed two-level metaheuristic was evaluated on well-known benchmark instances. The evaluation’s results indicated that the proposed two-level metaheuristic performs well on most benchmark instances.http://dx.doi.org/10.1155/2022/3487355 |
| spellingShingle | Pisut Pongchairerks A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose Machines Complexity |
| title | A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose Machines |
| title_full | A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose Machines |
| title_fullStr | A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose Machines |
| title_full_unstemmed | A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose Machines |
| title_short | A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose Machines |
| title_sort | two level metaheuristic for the job shop scheduling problem with multipurpose machines |
| url | http://dx.doi.org/10.1155/2022/3487355 |
| work_keys_str_mv | AT pisutpongchairerks atwolevelmetaheuristicforthejobshopschedulingproblemwithmultipurposemachines AT pisutpongchairerks twolevelmetaheuristicforthejobshopschedulingproblemwithmultipurposemachines |