Cargando…
Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time
This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higher GoS level, knowing the total pro...
Autores principales: | Luo, Taibo, Xu, Yinfeng |
---|---|
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/PMC3942401/ https://www.ncbi.nlm.nih.gov/pubmed/24672335 http://dx.doi.org/10.1155/2014/576234 |
Ejemplares similares
-
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
por: Dósa, György, et al.
Publicado: (2017) -
An Evaluation of the Mechanisms of Galacto-Oligosaccharide (GOS)-Induced IgE Cross-Linking on Basophils in GOS Allergy
por: Lee, Li Yuan Gabriella Nadine, et al.
Publicado: (2022) -
Some Information Measures Properties of the GOS-Concomitants from the FGM Family
por: Suter, Florentina, et al.
Publicado: (2022) -
A call for an international network of genomic observatories (GOs)
por: Davies, Neil, et al.
Publicado: (2012) -
Gos: a declarative library for interactive genomics visualization in Python
por: Manz, Trevor, et al.
Publicado: (2023)