Cargando…
Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines
m unrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal resource allocation and the o...
Autores principales: | Zhang, Guang-Qian, Wang, Jian-Jun, Liu, Ya-Jing |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4058216/ https://www.ncbi.nlm.nih.gov/pubmed/24982933 http://dx.doi.org/10.1155/2014/242107 |
Ejemplares similares
-
MIP Models and Hybrid Algorithms for Simultaneous Job Splitting and Scheduling on Unrelated Parallel Machines
por: Yilmaz Eroglu, Duygu, et al.
Publicado: (2014) -
IPPS : Job scheduling strategies for parallel processing
por: Feitelson, Dror G, et al.
Publicado: (1995) -
Due-Window Assignment Scheduling with Variable Job Processing Times
por: Wu, Yu-Bin, et al.
Publicado: (2015) -
Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection
por: Zou, Juan, et al.
Publicado: (2014) -
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
por: Krim, Hanane, et al.
Publicado: (2021)