Abstract
Consider a number of jobs to be processed by a single machine. It is required to put these jobs in order so that the variation between jobs completion times is minimized. This problem is known to be computationally hard. In this paper several heuristics are developed and compared to each other and one of them is identified to out perform the others. The developed heuristics can be used in situations where fast and simple solutions with acceptable level of quality are needed.
| Original language | English |
|---|---|
| Pages (from-to) | 127-132 |
| Number of pages | 6 |
| Journal | Arabian Journal for Science and Engineering |
| Volume | 26 |
| Issue number | 2 B |
| State | Published - Oct 2001 |
Keywords
- Production scheduling
- Sequencing
- Single machine
- Variance minimization
ASJC Scopus subject areas
- General