Exact makespan minimization of unrelated parallel machines
We study methods for the exact solution of the unrelated parallel machine problem with makespan minimization, generally denoted as $R||C_\text{max}$. Our original application arises from the automotive assembly process where tasks needs to be distributed among several robots. This involves the solut...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Université de Montpellier
2021-05-01
|
| Series: | Open Journal of Mathematical Optimization |
| Subjects: | |
| Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.4/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|