Abstract
In this paper, minimizing makespan for singlemachine scheduling problem with human energy recovery function under nonlinear time-dependent deterioration is considered. Firstly, a human recovery function is proposed according to the length of a rate-modifying activity (RMA) (i.e. the length of the rest time). Meanwhile, it is the first paper to introduce the recovery function into a scheduling problem. And the problem is proved to be an NP-hard problem. Then, a special case of the problem is proved to be solved in polynomial time.
Original language | English |
---|---|
Pages (from-to) | 279-285 |
Number of pages | 7 |
Journal | IAENG International Journal of Applied Mathematics |
Volume | 45 |
Issue number | 4 |
Publication status | Published - 1 Jan 2015 |
Keywords
- Human recovery function
- Makespan
- NP-hard problem
- Rate-modifying activity
- Scheduling
- Timedependent deterioration
ASJC Scopus subject areas
- Applied Mathematics