![](/images/graphics-bg.png)
Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-07-28
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered.
The start time of the maintenance is restricted to a time window.
The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized.
An approximation algorithm based on the classical Earliest Due Date first rule is proposed.
It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.
American Psychological Association (APA)
Wang, Ting& Xu, Dehua. 2015. Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-5.
https://search.emarefa.net/detail/BIM-1074606
Modern Language Association (MLA)
Wang, Ting& Xu, Dehua. Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness. Mathematical Problems in Engineering No. 2015 (2015), pp.1-5.
https://search.emarefa.net/detail/BIM-1074606
American Medical Association (AMA)
Wang, Ting& Xu, Dehua. Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-5.
https://search.emarefa.net/detail/BIM-1074606
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1074606