An improved algorithm to minimize the total completion time in a two-machine no-wait flow-shop with uncertain setup times
Since scheduling literature has a wide range of uncertainties, it is crucial to take these into account when solving performance measure problems. Otherwise, the performance may severely be affected in a negative way. In this paper, an algorithm is proposed to minimize the total completion...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2022-01-01
|
| Series: | Journal of Project Management |
| Online Access: | http://www.growingscience.com/jpm/Vol7/jpm_2021_19.pdf |