Scheduling uniform machines with restricted assignment
From MaRDI portal
Publication:2688627
DOI10.3934/mbe.2022450OpenAlexW4285191302MaRDI QIDQ2688627
Publication date: 3 March 2023
Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/mbe.2022450
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast approximation algorithms for job scheduling with processing set restrictions
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Scheduling for parallel processing
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions
- Parallel machine scheduling under a grade of service provision
- Scheduling unit-length jobs with machine eligibility restrictions
- On-Line Load Balancing in a Hierarchical Server Topology
- Scheduling parallel machines with inclusive processing set restrictions
- Task Scheduling on a Multiprocessor System with Independent Memories
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with job assignment restrictions
This page was built for publication: Scheduling uniform machines with restricted assignment