DC & GR instances

Sets of instances for the P||Cmax problem.   They are formatted in JSON. In each instance entry, n is the number of jobs, m the number of machines, P is the list of processing times.   DCU and DCNU instances are generated according to [1].   GR1, GR2 and GR3 instances are generated according to [2]....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Hadj-Djilani, Hakim
Format: Dataset
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Sets of instances for the P||Cmax problem.   They are formatted in JSON. In each instance entry, n is the number of jobs, m the number of machines, P is the list of processing times.   DCU and DCNU instances are generated according to [1].   GR1, GR2 and GR3 instances are generated according to [2]. GR2 instance set uses m = 5 as an extra value which is not used in [2].   [1] Della Croce, F.  & Scatamacchia, R. (2020). The longest processing time rule for identical parallel machines revisited.  Journal of Scheduling, 23(2), 163–176.   [2] Gupta, J. N. & Ruiz-Torres, A. J. (2001). A listfit heuristic for minimizing makespan on identical parallel machines.  Production Planning & Control, 12(1), 28–36.  
DOI:10.5281/zenodo.10203753