A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem
The Just-In-Time (JIT) scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2015/350308 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832563324615655424 |
|---|---|
| author | Sivashan Chetty Aderemi O. Adewumi |
| author_facet | Sivashan Chetty Aderemi O. Adewumi |
| author_sort | Sivashan Chetty |
| collection | DOAJ |
| description | The Just-In-Time (JIT) scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA), is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS) and Simulated Annealing (SA). SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm. |
| format | Article |
| id | doaj-art-e5bdb61812024e278646c8fc296d83f8 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-e5bdb61812024e278646c8fc296d83f82025-02-03T01:20:34ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2015-01-01201510.1155/2015/350308350308A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling ProblemSivashan Chetty0Aderemi O. Adewumi1School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, University Road, Westville, Private Bag X 54001, Durban 4000, South AfricaSchool of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, University Road, Westville, Private Bag X 54001, Durban 4000, South AfricaThe Just-In-Time (JIT) scheduling problem is an important subject of study. It essentially constitutes the problem of scheduling critical business resources in an attempt to optimize given business objectives. This problem is NP-Hard in nature, hence requiring efficient solution techniques. To solve the JIT scheduling problem presented in this study, a new local search metaheuristic algorithm, namely, the enhanced Best Performance Algorithm (eBPA), is introduced. This is part of the initial study of the algorithm for scheduling problems. The current problem setting is the allocation of a large number of jobs required to be scheduled on multiple and identical machines which run in parallel. The due date of a job is characterized by a window frame of time, rather than a specific point in time. The performance of the eBPA is compared against Tabu Search (TS) and Simulated Annealing (SA). SA and TS are well-known local search metaheuristic algorithms. The results show the potential of the eBPA as a metaheuristic algorithm.http://dx.doi.org/10.1155/2015/350308 |
| spellingShingle | Sivashan Chetty Aderemi O. Adewumi A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem Discrete Dynamics in Nature and Society |
| title | A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem |
| title_full | A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem |
| title_fullStr | A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem |
| title_full_unstemmed | A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem |
| title_short | A Study on the Enhanced Best Performance Algorithm for the Just-in-Time Scheduling Problem |
| title_sort | study on the enhanced best performance algorithm for the just in time scheduling problem |
| url | http://dx.doi.org/10.1155/2015/350308 |
| work_keys_str_mv | AT sivashanchetty astudyontheenhancedbestperformancealgorithmforthejustintimeschedulingproblem AT aderemioadewumi astudyontheenhancedbestperformancealgorithmforthejustintimeschedulingproblem AT sivashanchetty studyontheenhancedbestperformancealgorithmforthejustintimeschedulingproblem AT aderemioadewumi studyontheenhancedbestperformancealgorithmforthejustintimeschedulingproblem |