Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
From MaRDI portal
Publication:6049692
DOI10.1515/math-2022-0562zbMath1521.90075OpenAlexW4322707934MaRDI QIDQ6049692
Xiao Xin, Shuguang Li, Muhammad Ijaz Khan
Publication date: 15 September 2023
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2022-0562
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- A polynomial algorithm for the multiple knapsack problem with divisible item sizes
- Bin packing with divisible item sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Algorithms for the variable sized bin packing problem
- Scheduling with batching: A review
- A survey of scheduling with parallel batch (p-batch) processing
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- Scheduling unit-length jobs with machine eligibility restrictions
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- Windows scheduling as a restricted version of bin packing
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Improved bounds for batch scheduling with nonidentical job sizes
This page was built for publication: Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
