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: | Yucel Ozturkoglu |
---|---|
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 |
Similar Items
-
Propose a Polynomial Time Algorithm for Total Completion Time Objective
by: Yucel Ozturkoglu, et al.
Published: (2021-06-01) -
Job shop scheduling with makespan objective: A heuristic approach
by: Mohsen Ziaee
Published: (2014-04-01) -
Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan
by: Eka Pakpahan, et al.
Published: (2023-03-01) -
Identical parallel machine scheduling with nonlinear deterioration and multiple rate modifying activities
by: Ömer Öztürkoğlu
Published: (2017-07-01) -
Machine scheduling of time-dependent deteriorating jobs with determining the optimal number of rate modifying activities and the position of the activities
by: Cheol Min JOO, et al.
Published: (2015-03-01)