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...

Full description

Saved in:
Bibliographic Details
Published inAn international journal of optimization and control Vol. 5; no. 2; pp. 75 - 80
Main Author Ozturkoglu, Yucel
Format Journal Article
LanguageEnglish
Published Balikesir Balikesir University, Faculty of Engineering Department of Industrial Engineering 01.01.2015
Subjects
Algorithms
Deterioration
Inserts
Job shops
Maintenance
Optimization
Polynomials
Production scheduling
Schedules
Scheduling
Stems
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:2146-0957
2146-5703
DOI:10.11121/ijocta.01.2015.00260