A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
Publication:2160790
DOI10.3934/mbe.2019224zbMath1497.90106OpenAlexW2945343070WikidataQ93200458 ScholiaQ93200458MaRDI QIDQ2160790
Zhiyao Lu, Zizhao Huang, Wei Qin, Zilong Zhuang, Cheng-liang Liu
Publication date: 3 August 2022
Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/mbe.2019224
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Open shop scheduling problem to minimize makespan with release dates
- Dense open-shop schedules with release times
- A branch \(\&\) bound algorithm for the open-shop problem
- A hybrid genetic algorithm for the open shop scheduling problem
- Benchmarks for basic scheduling problems
- Power-law distributions in binned empirical data
- Emergence of Scaling in Random Networks
- Power-Law Distributions in Empirical Data
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Open Shop Scheduling to Minimize Finish Time
- Collective dynamics of ‘small-world’ networks
- Solving the open shop scheduling problem
This page was built for publication: A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates