Abstract
In this paper we investigate a single machine scheduling problem with deteriorating jobs and group technology assumption. By deteriorating jobs and group technology assumption, we mean that job processing times are simple linear functions of its starting times. The group setup times are assumed to be known and fixed. We attempt to minimize the makespan with ready times of the jobs. For a special case, we show that the problem can be solved in polynomial time when deterioration and group technology are considered simultaneously.
| Original language | English |
|---|---|
| Pages (from-to) | 643-649 |
| Number of pages | 7 |
| Journal | International Journal of Advanced Manufacturing Technology |
| Volume | 60 |
| Issue number | 5-8 |
| DOIs | |
| Publication status | Published - 1 May 2012 |
Keywords
- Deteriorating jobs
- Group technology
- Ready time
- Scheduling
- Single machine
ASJC Scopus subject areas
- Control and Systems Engineering
- Software
- Mechanical Engineering
- Computer Science Applications
- Industrial and Manufacturing Engineering