ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS
The article considers the original algorithmfor solving the generalized problem ofscheduling theory, based on the branch and bound method. Task schedulingperform works (operations) and restrictions on resources used often occur with scheduling discrete manufacturing operations, optimizing network im...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Plekhanov Russian University of Economics
2016-08-01
|
| Series: | Статистика и экономика |
| Subjects: | |
| Online Access: | https://statecon.rea.ru/jour/article/view/766 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|