Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents

We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive th...

Descripción completa

Detalles Bibliográficos
Autores principales: Lee, Wen-Chiung, Shiau, Yau-Ren, Chung, Yu-Hsiang, Ding, Lawson
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/PMC3915531/
https://www.ncbi.nlm.nih.gov/pubmed/24574901
http://dx.doi.org/10.1155/2014/596306

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3915531/
https://www.ncbi.nlm.nih.gov/pubmed/24574901
http://dx.doi.org/10.1155/2014/596306

Ejemplares similares