{"paper_id":"2406.02102","title":"Simulation-based approach for Multiproject Scheduling based on composite priority rules","authors":["Pablo Alvarez-Campana","Felix Villafanez","Fernando Acebes","David Poza"],"paper_date":"2024-06-04","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2406.02102v1","page_url":"https://thequant.space/flowcharts/simulation-based-approach-for-multiproject-scheduling-based/","scores":{"empirical_rigor":8,"math_complexity":3.5,"quadrant":"Street Traders"},"proposes":{"status":"available","statement":"The paper proposes a simulation-based approach that sequentially applies multiple priority criteria to enhance the performance of heuristics for multi‑project scheduling.","quote":"This paper presents a simulation approach to enhance the performance of heuristics for multi-project scheduling.","summary":"This paper presents a simulation approach to enhance the performance of heuristics for multi-project scheduling. Unlike other heuristics available in the literature that use only one priority criterion for resource allocation, this paper proposes a structured way to sequentially apply more than one…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Resources are limited in their availability, requiring the heuristic to satisfy resource‑constrained scheduling constraints.","type":"execution","stated":"explicit","quote":"However, in practice, resources are limited in their availability.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"MPSPLib","provider":null,"kind":"benchmark","access":"public","period":null,"universe":null,"quote":"The performance of this simulation approach was validated with the MPSPLib library, one of the most prominent libraries for resource-constrained multi-project scheduling. Thus for all 140 problems in the library, MPSPLib provides a ranking of the best solutions found to date for each problem.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"The Drawers Heuristic provides the best known total makespan result for 39 out of 140 benchmark problems (27%).","kind":"performance","quote":"It shows that this configuration of the heuristic provides the best result to date in 39 of the 140 problems (27 %).","support":"full"},{"finding":"It achieves an equal or better result than existing heuristics for 57 out of 140 problems (40%).","kind":"performance","quote":"It also achieves an equal or better result than the existing ones in 57 of the 140 problems (40 %).","support":"full"},{"finding":"For 108 problems (77%), the heuristic’s makespan is within 5% of the best‑known solution.","kind":"performance","quote":"In these cases, the difference between the result obtained by our heuristic and the best solution to date is less than 5 % in 108 of the problems (77 %).","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":9,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:56:48Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}