Instance dataset for a multiprocessor scheduling problem with multiple time windows and time lags: Similar instances with large differences in difficulty

The dataset presented in this paper introduces 384 new instances for the feasibility version of a multiprocessor scheduling problem with multiple time windows, positive time lags and exact time lags. The instances are constructed from subproblems in a logic-based Benders decomposition scheme introdu...

Descripción completa

Detalles Bibliográficos
Autores principales: Karlsson, Emil, Rönnberg, Elina
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2022
Materias:
Data Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9679685/
https://www.ncbi.nlm.nih.gov/pubmed/36426038
http://dx.doi.org/10.1016/j.dib.2022.108687

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9679685/
https://www.ncbi.nlm.nih.gov/pubmed/36426038
http://dx.doi.org/10.1016/j.dib.2022.108687

Ejemplares similares