Scheduling Jobs with Maintenance Subject to Load-Dependent Duration on a Single Machine
Joint Authors
Qi, Yawei
Wan, Long
Yan, Zhigang
Source
Mathematical Problems in Engineering
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-07-27
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
This paper investigates a scheduling problem on a single machine with maintenance, in which the starting time of the maintenance is given in advance but its duration depends on the load of the machine before the maintenance.
The goal is to minimize the makespan.
We formulate it as an integer programming model and show that it is NP-hard in the ordinary sense.
Then, we propose an FPTAS and point out that a special case is polynomial solvable.
Finally, we design fast heuristic algorithms to solve the scheduling problem.
Numerical experiments are implemented to evaluate the performance of the proposed heuristic algorithms.
The results show the proposed heuristic algorithms are effective.
American Psychological Association (APA)
Qi, Yawei& Wan, Long& Yan, Zhigang. 2015. Scheduling Jobs with Maintenance Subject to Load-Dependent Duration on a Single Machine. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-6.
https://search.emarefa.net/detail/BIM-1073201
Modern Language Association (MLA)
Qi, Yawei…[et al.]. Scheduling Jobs with Maintenance Subject to Load-Dependent Duration on a Single Machine. Mathematical Problems in Engineering No. 2015 (2015), pp.1-6.
https://search.emarefa.net/detail/BIM-1073201
American Medical Association (AMA)
Qi, Yawei& Wan, Long& Yan, Zhigang. Scheduling Jobs with Maintenance Subject to Load-Dependent Duration on a Single Machine. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-6.
https://search.emarefa.net/detail/BIM-1073201
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1073201