A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
From MaRDI portal
Publication:2160790
Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites work
- A branch \(\&\) bound algorithm for the open-shop problem
- A hybrid genetic algorithm for the open shop scheduling problem
- Benchmarks for basic scheduling problems
- Collective dynamics of `small-world' networks
- Dense open-shop schedules with release times
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Open shop scheduling problem to minimize makespan with release dates
- Open Shop Scheduling to Minimize Finish Time
- Power-law distributions in binned empirical data
- Power-law distributions in empirical data
- Solving the open shop scheduling problem
Cited in
(4)- A measure of identifying influential community based on the state of critical functionality
- A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes
- Resource dependent scheduling with truncated learning effects
- A complex network model for a society with socioeconomic classes
This page was built for publication: A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2160790)
