An exact block algorithm for no-idle RPQ problem
In the work a single-machine scheduling problem is being considered, in which all tasks have a fixed availability (release) and delivery time. In the analyzed variant no-idle time is allowed on a machine. The purpose of optimization is to determine such order of tasks that minimizes the makespan, i....
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Polish Academy of Sciences
2017-06-01
|
| coleção: | Archives of Control Sciences |
| Assuntos: | |
| Acesso em linha: | http://www.degruyter.com/view/j/acsc.2017.27.issue-2/acsc-2017-0021/acsc-2017-0021.xml?format=INT |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|