Cargando…
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach...
Autores principales: | Krim, Hanane, Zufferey, Nicolas, Potvin, Jean-Yves, Benmansour, Rachid, Duvivier, David |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8929393/ https://www.ncbi.nlm.nih.gov/pubmed/35330884 http://dx.doi.org/10.1007/s10951-021-00711-9 |
Ejemplares similares
-
Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem
por: Peng, Chong, et al.
Publicado: (2019) -
Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection
por: Zou, Juan, et al.
Publicado: (2014) -
A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem
por: Escamilla Serna, Nayeli Jazmin, et al.
Publicado: (2021) -
IPPS : Job scheduling strategies for parallel processing
por: Feitelson, Dror G, et al.
Publicado: (1995) -
Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines
por: Zhang, Guang-Qian, et al.
Publicado: (2014)