MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVER
The problem of scheduling jobs on two parallel machines to minimize the sum of completion times is considered. Each job requires a setup which is done by a single server. It is known that this problem is strongly NP-hard. Two mixed integer linear programming models and a simulated annealing algorith...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2016-10-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/135 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!