Scheduling Jobs with Stochastic Processing Time on Parallel Identical Machines
Authors: Richard Stec, Antonin Novak, Premysl Sucha, Zdenek Hanzalek
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | The experimental results show that our method outperforms the existing approaches. (Abstract) and Section 5: Experimental Results |
| Researcher Affiliation | Academia | 1Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague, CZ 2Faculty of Electrical Engineering, Czech Technical University in Prague, CZ |
| Pseudocode | Yes | Algorithm 1 LJAF heuristics (Section 2.2 Initial Heuristics) |
| Open Source Code | No | The paper does not explicitly state that the source code for the described methodology is publicly available or provide a link to it. |
| Open Datasets | No | The paper states: "All the instances were generated according to the methodology proposed by [Ranjbar et al., 2012]." While it references a methodology for data generation, it does not provide direct access (link, DOI, specific repository) to the generated instances/dataset itself, nor does it refer to a commonly known public dataset. |
| Dataset Splits | No | The paper describes how instances were created ("For each combination of the parameters, 10 instances were created"), but does not specify a training/validation/test split or cross-validation setup for these instances in the traditional machine learning sense. The instances are solved to evaluate the algorithms. |
| Hardware Specification | Yes | The program was run on a server with two Intel Xeon E5 2.60 GHz processors, 252 GB RAM memory and a 64-bit operating system. (Section 5.1 Instances and Testing Environment) |
| Software Dependencies | Yes | The Master and Pricing problems were solved using Gurobi 8.0 solver. (Section 5.1 Instances and Testing Environment) and ...solution with SCIP 6.0.0 [Gleixner et al., 2018] non-linear mixed-integer solver takes about 3000 s. (Section 5.3 Non-linear Mixed-Integer Model) |
| Experiment Setup | Yes | We chose 2, 4 and 6 parallel machines with 14,16,18 and 20 jobs to schedule. Parameter c, which influences the range in which the variances were generated, had two possible values, specifically 0.25 and 0.75. For each combination of the parameters, 10 instances were created... Time limit for each instance was set to 3600 seconds. The Branch-and-Price method was allowed to use up to 16 CPU cores. Since the Branch-and-Bound method... is not designed to use more than single core, it was run only on a single CPU. (Section 5.1 Instances and Testing Environment) |