Cargando…
Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents
This study considers a scheduling environment in which there are two agents and a set of jobs, each of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear function of its starting time. Each of the two agents competes to process its respective jobs...
Autores principales: | Li, Hongjie, Li, Zeyuan, Yin, Yunqiang |
---|---|
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/PMC4055495/ https://www.ncbi.nlm.nih.gov/pubmed/25009829 http://dx.doi.org/10.1155/2014/471016 |
Ejemplares similares
-
Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
por: Lee, Wen-Chiung, et al.
Publicado: (2014) -
Due date-related scheduling with two agents: models and algorithms
por: Yin, Yunqiang, et al.
Publicado: (2020) -
The Tolerance Scheduling Problem in a Single Machine Case
por: Rossit, Daniel Alejandro, et al.
Publicado: (2020) -
Single-machine scheduling with periodic maintenance and learning effect
por: Wu, Hui, et al.
Publicado: (2023) -
Single machine scheduling problems with sequence-dependent setup times and precedence delays
por: Lin, Shih-Wei, et al.
Publicado: (2022)