Scheduling jobs with sizes and delivery times on identical parallel batch machines
From MaRDI portal
Publication:2202014
DOI10.1016/j.tcs.2020.06.023zbMath1455.90070OpenAlexW3036543186MaRDI QIDQ2202014
Publication date: 17 September 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.06.023
Related Items (2)
A survey of job shop scheduling problem: the types and models ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Scheduling a batching machine
- An approximation algorithm for the generalized assignment problem
- A PTAS for semiconductor burn-in scheduling
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Improved Algorithms for Bipartite Network Flow
- Scheduling a single batch processing machine with non-identical job sizes
- Improved bounds for batch scheduling with nonidentical job sizes
- Computing and Combinatorics
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Scheduling jobs with sizes and delivery times on identical parallel batch machines
