当前位置: X-MOL 学术arXiv.cs.PF › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Large-Scale Benchmarks for the Job Shop Scheduling Problem
arXiv - CS - Performance Pub Date : 2021-01-25 , DOI: arxiv-2102.08778
Giacomo Da Col, Erich Teppan

This report contains the description of two novel job shop scheduling benchmarks that resemble instances of real scheduling problem as they appear in industry. In particular, the aim was to provide large-scale benchmarks (up to 1 million operations) to test the state-of-the-art scheduling solutions on problems that are closer to what occurs in a real industrial context. The first benchmark is an extension of the well known Taillard benchmark (1992), while the second is a collection of scheduling instances with a known-optimum solution.

中文翻译:

作业车间调度问题的大规模基准

该报告包含对两种新颖的车间调度基准的描述,它们类似于行业中出现的实际调度问题的实例。特别是,其目的是提供大规模基准测试(最多100万次操作),以测试最接近实际工业环境中出现的问题的最新调度解决方案。第一个基准是著名的Taillard基准(1992)的扩展,而第二个基准是具有已知最佳解决方案的调度实例的集合。
更新日期:2021-02-18
down
wechat
bug