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...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Hindawi-Wiley
2021
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/7c095aa3cccf4e8a9fc5af3bd922bbec |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|