Benchmarks for Job Scheduling in Ultra-Distributed Systems
Abstract
References
Index Terms
- Benchmarks for Job Scheduling in Ultra-Distributed Systems
Recommendations
A hybrid particle swarm optimization for job shop scheduling problem
A hybrid particle swarm optimization (PSO) for the job shop problem (JSP) is proposed in this paper. In previous research, PSO particles search solutions in a continuous solution space. Since the solution space of the JSP is discrete, we modified the ...
Flexible job-shop scheduling with parallel variable neighborhood search algorithm
Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Other conferences](/cms/asset/9d239286-014e-4593-bd6a-93e2b151db08/3631309.cover.jpg)
In-Cooperation
- IFIP
- Usenix
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Research and Development Project of the Enhanced Infrastructures for Post-5G Information and Communication Systems (JPNP20017), commissioned by the New Energy and Industrial Technology Development Organization (NEDO)
Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 93Total Downloads
- Downloads (Last 12 months)63
- Downloads (Last 6 weeks)5
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in