An improved NEH heuristic to minimize makespan for flow shop scheduling problems
Flow shop scheduling problems with rudimentary criteria of minimum makespan are the most important investigated problems in the field of scheduling. Generally during the process of generating an optimal sequence, multiple partial sequences claiming the optimal value of makespan are observed. In this...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2021-01-01
|
| Series: | Decision Science Letters |
| Online Access: | http://www.growingscience.com/dsl/Vol10/dsl_2021_11.pdf |