An efficient implementation of a VNS heuristic for the weighted fair sequences problem
From MaRDI portal
Publication:6146639
DOI10.1111/itor.13197OpenAlexW4292661194MaRDI QIDQ6146639
Caroline Rocha, Daniel Aloise, Lucidio A. F. Cabral, Unnamed Author
Publication date: 31 January 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13197
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect periodic scheduling for three basic cycles
- Real time scheduling theory: A historical perspective
- Response time variability
- Variable neighbourhood search: Methods and applications
- Mathematical programming modeling of the response time variability problem
- A note on preemptive scheduling of periodic, real-time tasks
- Variable neighborhood search
- The scheduling of maintenance service
- The data broadcast problem with non-uniform transmission times
- The weighted fair sequences problem
- State of the art in Physician scheduling
- Proportionate progress: A notion of fairness in resource allocation
- Schedulers for larger classes of pinwheel instances
- Minimizing variation of production rates in just-in-time systems: A survey
- Principles of Sequencing and Scheduling
- Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Distance-constrained scheduling and its applications to real-time systems
- Windows Scheduling Problems for Broadcast Systems
- Variable Neighborhood Search
- Scheduling Commercial Videotapes in Broadcast Television
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Minimizing Service and Operation Costs of Periodic Scheduling
- Scheduling
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
This page was built for publication: An efficient implementation of a VNS heuristic for the weighted fair sequences problem
