Scheduling jobs with sizes and delivery times on identical parallel batch machines
From MaRDI portal
Publication:2202014
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
- scientific article; zbMATH DE number 6678949 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- scientific article; zbMATH DE number 1445306 (Why is no real title available?)
- A PTAS for semiconductor burn-in scheduling
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for NP-hard problems.
- Bounds on Multiprocessing Timing Anomalies
- Computing and Combinatorics
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Improved Algorithms for Bipartite Network Flow
- Improved bounds for batch scheduling with nonidentical job sizes
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a batching machine
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling algorithms
Cited in
(12)- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
- Parallel-machine scheduling to minimize flowtime, holding, and batch delivery costs
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- scientific article; zbMATH DE number 7234265 (Why is no real title available?)
- 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
- 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
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
- Integrated production and delivery on parallel batching machines
- An improved algorithm for scheduling two identical machines with batch delivery consideration
- A survey of job shop scheduling problem: the types and models
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)
