Analysis of the similarities and differences of job-based scheduling problems
From MaRDI portal
Publication:723975
DOI10.1016/J.EJOR.2018.01.051zbMath1403.90347DBLPjournals/eor/LuSFZM18OpenAlexW2789582031WikidataQ58934853 ScholiaQ58934853MaRDI QIDQ723975
Kefei Mao, Hui Lu, Jinhua Shi, Zongming Fei, Qianlin Zhou
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.01.051
Related Items (2)
Adaptive online data-driven closed-loop parameter control strategy for swarm intelligence algorithm ⋮ Spatial-domain fitness landscape analysis for combinatorial optimization
Cites Work
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- An effective architecture for learning and evolving flexible job-shop schedules
- A state-of-the-art review of parallel-machine scheduling research
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Routing and scheduling in a flexible job shop by tabu search
- A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES
- Dynamic programming algorithm optimization for spoken word recognition
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Taxonomy for the Flexible Job Shop Scheduling Problem
- Job Shop Scheduling by Local Search
- Handbook on Scheduling
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Analysis of the similarities and differences of job-based scheduling problems
