Scheduling jobs with sizes and delivery times on identical parallel batch machines
From MaRDI portal
Publication:2202014
DOI10.1016/J.TCS.2020.06.023zbMATH Open1455.90070OpenAlexW3036543186MaRDI QIDQ2202014FDOQ2202014
Authors: Yijie Li, Shu-Guang Li 
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
Recommendations
- Batch scheduling of identical jobs on parallel identical machines
- Scheduling parallel batch processing machines with non-identical job sizes
- Parallel-machine batch scheduling with non-identical job sizes
- Scheduling identical parallel machines with a fixed number of delivery dates
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
- Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Scheduling Equal-Length Jobs with Delivery times on Identical Processors
Cites Work
- Title not available (Why is that?)
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for NP-hard problems.
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a batching machine
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on Multiprocessing Timing Anomalies
- Scheduling algorithms
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- 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
- Scheduling a single batch processing machine with non-identical job sizes
- Computing and Combinatorics
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Title not available (Why is that?)
- Improved Algorithms for Bipartite Network Flow
- Title not available (Why is that?)
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- A PTAS for semiconductor burn-in scheduling
- Improved bounds for batch scheduling with nonidentical job sizes
Cited In (12)
- Parallel-machine scheduling to minimize flowtime, holding, and batch delivery costs
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- Scheduling on a single machine and parallel machines with batch deliveries and potential disruption
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
- Integrated production and delivery on parallel batching machines
- A survey of job shop scheduling problem: the types and models
- An improved algorithm for scheduling two identical machines with batch delivery consideration
- Title not available (Why is that?)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
This page was built for publication: Scheduling jobs with sizes and delivery times on identical parallel batch machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202014)
