Abstract
The focus of this paper is to analyze unrelated parallel-machine resource allocation scheduling problem with learning effect and deteriorating jobs. The goal is to find the optimal sequence of jobs and the optimal resource allocation separately for minimizing the cost function including the total load, the total completion time, the total absolute deviation of completion time and the total resource cost. We show that the problem is polynomial time solvable if the number of machines is a given constant.
| Original language | English |
|---|---|
| Pages (from-to) | 1993-2000 |
| Number of pages | 8 |
| Journal | Neural Computing and Applications |
| Volume | 27 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 1 Oct 2016 |
Keywords
- Deteriorating jobs
- Learning effect
- Parallel machine
- Resource allocation
- Scheduling
ASJC Scopus subject areas
- Software
- Artificial Intelligence