Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/35807
Title: Parallel machines scheduling with simple linear job deterioration and non-simultaneous machine available times
Authors: Wang, XY
Zhou, ZL
Ji, P 
Wang, JB
Keywords: Scheduling
Parallel machines
Deteriorating jobs
Worst-case analysis
Machine availability constraint
Issue Date: 2014
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2014, v. 74, p. 88-91 How to cite?
Journal: Computers and industrial engineering 
Abstract: In this note, we deal with the parallel-machine scheduling of deteriorating jobs where the actual processing of a job is a simple linear function of the job's starting time. The jobs are available at time zero but the machines may not be available simultaneously at time zero. For the problem to minimize the logarithm of makespan, we present heuristic algorithms and analyze their worst-case error bounds.
URI: http://hdl.handle.net/10397/35807
ISSN: 0360-8352
DOI: 10.1016/j.cie.2014.05.003
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

6
Last Week
0
Last month
Citations as of May 20, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
Citations as of May 20, 2017

Page view(s)

20
Last Week
0
Last month
Checked on May 21, 2017

Google ScholarTM

Check

Altmetric



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