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...

Descripción completa

Detalles Bibliográficos
Autores principales: Zhang, Guang-Qian, Wang, Jian-Jun, Liu, Ya-Jing
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
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

Internet

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