Solving certain problems of scheduling theory by the methods of quadratic optimization
The pipeline task of scheduling theory (flow shop) with the standard constraints, the variables of which are the times of the beginning of processing of each of the tasks on the corresponding device are investigated. Tasks of this type belong to the NP-complex class with the number of processing dev...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PC Technology Center
2017-07-01
|
| Series: | Tehnologìčnij Audit ta Rezervi Virobnictva |
| Subjects: | |
| Online Access: | http://journals.uran.ua/tarp/article/view/108909 |