A fine-grained parallel algorithm for the cyclic flexible job shop problem
In this paper there is considered a flexible job shop problem of operations scheduling. The new, very fast method of determination of cycle time is presented. In the design of heuristic algorithm there was the neighborhood inspired by the game of golf applied. Lower bound of the criterion function w...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2017-06-01
|
| Series: | Archives of Control Sciences |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/acsc.2017.27.issue-2/acsc-2017-0010/acsc-2017-0010.xml?format=INT |