Scheduling unrelated parallel batch processing machines with non-identical job sizes
From MaRDI portal
Publication:336679
DOI10.1016/J.COR.2013.06.016zbMATH Open1348.90285OpenAlexW2012468641MaRDI QIDQ336679FDOQ336679
Authors: Yanli Huang, Qi Tan, Huaping Chen, Xiaolin Li 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.06.016
Recommendations
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Scheduling parallel batch processing machines with non-identical job sizes
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Parallel-machine batch scheduling with non-identical job sizes
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
Cites Work
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- Makespan minimization on single batch-processing machine via ant colony optimization
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Scheduling a single batch processing machine with non-identical job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Minimizing total completion time on a batch processing machine with job families
- Title not available (Why is that?)
Cited In (32)
- MILP models to minimise makespan in additive manufacturing machine scheduling problems
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing
- Weak-restriction based algorithm for scheduling on parallel batch machines with arbitrary capacities
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- A solution framework for scheduling a BPM with non-identical job dimensions
- Parallel batching with multi-size jobs and incompatible job families
- A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
- Scheduling unrelated additive manufacturing machines with practical constraints
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- Scheduling an unbounded batching machine with job processing time compatibilities
- Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Title not available (Why is that?)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
- Metaheuristics for scheduling batch processing machines in a distributed environment
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- A survey of scheduling with parallel batch (p-batch) processing
- Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes
- Scheduling parallel batch processing machines with non-identical job sizes
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Scheduling unrelated parallel machines with optional machines and jobs selection
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints
- Two-customer parallel batch processing machines with non-identical job sizes
This page was built for publication: Scheduling unrelated 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 Q336679)
