Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (make...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Iran University of Science & Technology
2017-03-01
|
| Series: | International Journal of Industrial Engineering and Production Research |
| Subjects: | |
| Online Access: | http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-1012-1&slc_lang=en&sid=1 |