Back to Search
Start Over
Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs.
- Source :
-
International Journal of Systems Science . May2012, Vol. 43 Issue 5, p861-868. 8p. 1 Chart. - Publication Year :
- 2012
-
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. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00207721
- Volume :
- 43
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- International Journal of Systems Science
- Publication Type :
- Academic Journal
- Accession number :
- 71924108
- Full Text :
- https://doi.org/10.1080/00207721.2010.542837