Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
From MaRDI portal
Publication:2693572
DOI10.3934/mbe.2022502OpenAlexW2750522723MaRDI QIDQ2693572
Publication date: 24 March 2023
Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.06048
schedulingexact algorithmsprocessing set restrictionsequal job lengthsuniform parallel batch machines
Related Items (2)
Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines ⋮ A unified spectral-geometric model of FGM double conical/cylindrical/spherical shell coupled with annular plates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Selfish load balancing and atomic congestion games
- Complexity of scheduling problems with multi-purpose machines
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique.
- Scheduling with batching: A review
- Multipurpose machine scheduling with rejection and identical job processing times
- Ideal schedules in parallel machine settings
- Scheduling equal length jobs with eligibility restrictions
- Parallel batch scheduling with nested processing set restrictions
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Scheduling unit-length jobs with machine eligibility restrictions
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Delay-Optimal Server Allocation in Multiqueue Multiserver Systems With Time-Varying Connectivities
- Fibonacci heaps and their uses in improved network optimization algorithms
- Semi-matchings for bipartite graphs and load balancing
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
This page was built for publication: Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
