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...
Guardat en:
| Publicat a: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Autors principals: | , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
International Journal of Combinatorial Optimization Problems and Informatics
2014
|
| Matèries: | |
| Accés en línia: | https://www.redalyc.org/articulo.oa?id=265232977004 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|