Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/35809
Title: Single-machine scheduling with a variable maintenance activity
Authors: Luo, WC
Cheng, TCE 
Ji, M
Keywords: Scheduling
Maintenance
Single machine
Polynomial-time algorithm
Issue Date: 2015
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2015, v. 79, p. 168-174 How to cite?
Journal: Computers and industrial engineering 
Abstract: We consider the problem maintenance activity must starting time. We provide sum of completion times, of scheduling a maintenance activity and jobs on a single machine, where the start before a given deadline and the maintenance duration increases with its polynomial-time algorithms to solve the problems to minimize the makespan, maximum lateness, and number of tardy jobs.
URI: http://hdl.handle.net/10397/35809
ISSN: 0360-8352
DOI: 10.1016/j.cie.2014.11.002
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

11
Last Week
0
Last month
Citations as of Mar 20, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
Citations as of Mar 23, 2017

Page view(s)

18
Last Week
1
Last month
Checked on Mar 26, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.