Bounds for the permutation owshop scheduling problem with exact time lags to minimize the total earliness and tardiness
We consider the problem of n -jobs scheduling in an m -machine permutation owshop with exact time lags between consecutive operations of each job. The exact time lag is dened as the time elapsed between every couple of successive operations of the same job which is equal to a prescribed value. The a...
שמור ב:
| הוצא לאור ב: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Principais autores: | , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
International Journal of Combinatorial Optimization Problems and Informatics
2014
|
| נושאים: | |
| גישה מקוונת: | https://www.redalyc.org/articulo.oa?id=265232977004 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|