Back to Search
Start Over
Single-machine scheduling with controllable processing times and learning effect.
- Source :
-
International Journal of Advanced Manufacturing Technology . May2011, Vol. 54 Issue 5-8, p743-748. 6p. - Publication Year :
- 2011
-
Abstract
- In this paper, we consider single-machine scheduling problem with controllable processing times and learning effect, i.e., processing times of jobs are controllable variables with linear costs and also are defined as functions of positions in a schedule. We concentrate on two goals separately, namely minimizing a cost function containing makespan, total completion time, total absolute differences in completion times, and total compression cost and minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times, and total compression cost. The problem is modeled as an assignment problem and thus can be solved with the well-known algorithms. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02683768
- Volume :
- 54
- Issue :
- 5-8
- Database :
- Academic Search Index
- Journal :
- International Journal of Advanced Manufacturing Technology
- Publication Type :
- Academic Journal
- Accession number :
- 60310782
- Full Text :
- https://doi.org/10.1007/s00170-010-2973-z