Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17718
Title: Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
Authors: Wang, JB
Wang, MZ
Ji, P 
Keywords: deteriorating jobs
learning effect
scheduling
single machine
total completion time
Issue Date: 2012
Publisher: Taylor & Francis Ltd
Source: International journal of systems science, 2012, v. 43, no. 5, p. 861-868 How to cite?
Journal: International Journal of Systems Science 
Abstract: In this article, we consider a single machine scheduling problem with a time-dependent learning effect and deteriorating jobs. By the effects of time-dependent learning and deterioration, we mean that the job processing time is defined by a function of its starting time and total normal processing time of jobs in front of it in the sequence. The objective is to determine an optimal schedule so as to minimize the total completion time. This problem remains open for the case of -1<a<0, where a denotes the learning index; we show that an optimal schedule of the problem is V-shaped with respect to job normal processing times. Three heuristic algorithms utilising the V-shaped property are proposed, and computational experiments show that the last heuristic algorithm performs effectively and efficiently in obtaining near-optimal solutions.
URI: http://hdl.handle.net/10397/17718
DOI: 10.1080/00207721.2010.542837
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

36
Citations as of Jan 13, 2017

WEB OF SCIENCETM
Citations

58
Last Week
0
Last month
1
Citations as of Dec 14, 2016

Page view(s)

16
Last Week
0
Last month
Checked on Jan 15, 2017

Google ScholarTM

Check

Altmetric



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