A Job-Shop Scheduling Problem with Bidirectional Circular Precedence Constraints
This paper introduces a job-shop scheduling problem (JSP) with bidirectional circular precedence constraints, called BCJSP. In the problem, each job can be started from any operation and continued by its remaining operations in a circular precedence-relation chain via either a clockwise or countercl...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Wiley
2021-01-01
|
| coleção: | Complexity |
| Acesso em linha: | http://dx.doi.org/10.1155/2021/3237342 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|