An efficient time algorithm for makespan objectives
This paper focuses on a single machine scheduling subject to machine deterioration with rate-modifying activities (RMA). The motivation for this study stems from the automatic-production line problem with one machine. The main question is to find the sequence in which jobs should be scheduled, how m...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Balikesir University
2015-07-01
|
| Series: | An International Journal of Optimization and Control: Theories & Applications |
| Subjects: | |
| Online Access: | http://ijocta.balikesir.edu.tr/index.php/files/article/view/260/118 |
| _version_ | 1797918064697671680 |
|---|---|
| author | Yucel Ozturkoglu |
| author_facet | Yucel Ozturkoglu |
| author_sort | Yucel Ozturkoglu |
| collection | DOAJ |
| description | This paper focuses on a single machine scheduling subject to machine deterioration with rate-modifying activities (RMA). The motivation for this study stems from the automatic-production line problem with one machine. The main question is to find the sequence in which jobs should be scheduled, how many maintenance activity (RMA) to use, if any, and where to insert them in the schedule during the time interval with optimal makespan objective. This problem is known to be NP-hard and we give concise analyses of the problem and provide polynomial time algorithms to solve the makespan problem. We also propose an algorithm which can be applied to some scheduling problems with the actual processing time of job nonlinearly based on its position.
This paper focuses on a single machine scheduling subject to machine deterioration with rate-modifying activities (RMA). The motivation for this study stems from the automatic-production line problem with one machine. The main question is to find the sequence in which jobs should be scheduled, how many maintenance activity (RMA) to use, if any, and where to insert them in the schedule during the time interval with optimal makespan objective. This problem is known to be NP-hard and we give concise analyses of the problem and provide polynomial time algorithms to solve the makespan problem. We also propose an algorithm which can be applied to some scheduling problems with the actual processing time of job nonlinearly based on its position. |
| first_indexed | 2024-04-10T13:24:34Z |
| format | Article |
| id | doaj.art-47cb2085e63c4e97a40fc798e7dace1a |
| institution | Directory Open Access Journal |
| issn | 2146-0957 2146-5703 |
| language | English |
| last_indexed | 2024-04-10T13:24:34Z |
| publishDate | 2015-07-01 |
| publisher | Balikesir University |
| record_format | Article |
| series | An International Journal of Optimization and Control: Theories & Applications |
| spelling | doaj.art-47cb2085e63c4e97a40fc798e7dace1a2023-02-15T16:11:55ZengBalikesir UniversityAn International Journal of Optimization and Control: Theories & Applications2146-09572146-57032015-07-0152758010.11121/ijocta.01.2015.00260An efficient time algorithm for makespan objectivesYucel OzturkogluThis paper focuses on a single machine scheduling subject to machine deterioration with rate-modifying activities (RMA). The motivation for this study stems from the automatic-production line problem with one machine. The main question is to find the sequence in which jobs should be scheduled, how many maintenance activity (RMA) to use, if any, and where to insert them in the schedule during the time interval with optimal makespan objective. This problem is known to be NP-hard and we give concise analyses of the problem and provide polynomial time algorithms to solve the makespan problem. We also propose an algorithm which can be applied to some scheduling problems with the actual processing time of job nonlinearly based on its position. This paper focuses on a single machine scheduling subject to machine deterioration with rate-modifying activities (RMA). The motivation for this study stems from the automatic-production line problem with one machine. The main question is to find the sequence in which jobs should be scheduled, how many maintenance activity (RMA) to use, if any, and where to insert them in the schedule during the time interval with optimal makespan objective. This problem is known to be NP-hard and we give concise analyses of the problem and provide polynomial time algorithms to solve the makespan problem. We also propose an algorithm which can be applied to some scheduling problems with the actual processing time of job nonlinearly based on its position.http://ijocta.balikesir.edu.tr/index.php/files/article/view/260/118Scheduling; deteriorating jobs; rate-modifying-activity; single machine; makespan |
| spellingShingle | Yucel Ozturkoglu An efficient time algorithm for makespan objectives An International Journal of Optimization and Control: Theories & Applications Scheduling; deteriorating jobs; rate-modifying-activity; single machine; makespan |
| title | An efficient time algorithm for makespan objectives |
| title_full | An efficient time algorithm for makespan objectives |
| title_fullStr | An efficient time algorithm for makespan objectives |
| title_full_unstemmed | An efficient time algorithm for makespan objectives |
| title_short | An efficient time algorithm for makespan objectives |
| title_sort | efficient time algorithm for makespan objectives |
| topic | Scheduling; deteriorating jobs; rate-modifying-activity; single machine; makespan |
| url | http://ijocta.balikesir.edu.tr/index.php/files/article/view/260/118 |
| work_keys_str_mv | AT yucelozturkoglu anefficienttimealgorithmformakespanobjectives AT yucelozturkoglu efficienttimealgorithmformakespanobjectives |