Abstract
We propose new models of position-dependent processing times for single-machine group scheduling problems. The two objectives of the scheduling problems are to minimize the makespan and the total completion time, respectively. We present polynomial-time algorithms to solve the problems.
| Original language | English |
|---|---|
| Pages (from-to) | 1-5 |
| Number of pages | 5 |
| Journal | Computers and Industrial Engineering |
| Volume | 117 |
| DOIs | |
| Publication status | Published - 1 Mar 2018 |
Keywords
- Aging effect
- Group technology
- Learning effect
- Makespan
- Scheduling
- Single-machine
- Total completion time
ASJC Scopus subject areas
- General Computer Science
- General Engineering
Fingerprint
Dive into the research topics of 'Single-machine group scheduling with new models of position-dependent processing times'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver