Scheduling parallel batch processing machines with non-identical job sizes
From MaRDI portal
Publication:3445643
Recommendations
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Parallel-machine batch scheduling with non-identical job sizes
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
Cited in
(24)- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- A solution framework for scheduling a BPM with non-identical job dimensions
- Scheduling identical parallel machines and operators within a period based changing mode
- Batching and Scheduling Jobs on Batch and Discrete Processors
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Parallel machine batching and scheduling with deadlines
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Two-customer parallel batch processing machines with non-identical job sizes
- scientific article; zbMATH DE number 1783881 (Why is no real title available?)
- Parallel-machine batch scheduling with non-identical job sizes
- Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Scheduling jobs with normally distributed processing times on parallel machines
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Batch scheduling of identical jobs on parallel identical machines
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Metaheuristics for scheduling batch processing machines in a distributed environment
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- scientific article; zbMATH DE number 4033473 (Why is no real title available?)
- Scheduling a batch processing machine with non-identical job sizes
This page was built for publication: Scheduling parallel batch processing machines with non-identical job sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3445643)
