Abstract
Scheduling with learning effects has been widely studied. However, there are situations where the learning effect might accelerate. In this paper, we propose a new model where the learning effect accelerates as time goes by. We derive the optimal solutions for the single-machine problems to minimize the makespan, total completion time, total weighted completion time, maximum lateness, maximum tardiness, and total tardiness. C. E. Cheng et al.
Original language | English |
---|---|
Article number | 816235 |
Journal | Mathematical Problems in Engineering |
Volume | 2013 |
DOIs | |
Publication status | Published - 16 Dec 2013 |
ASJC Scopus subject areas
- Mathematics(all)
- Engineering(all)