Reentrant permutation flowshop scheduling with a deteriorating schedule
The classic flow shop problem assumes that jobs make only single passes through the processing machines and that the processing times are not affected by the length of the delay before jobs are processed. These assumptions are being relaxed in recent papers that consider reentrance problems and thos...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
University of Pretoria
2021
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2263/78077 |