Scheduling parallel-machine batch operations to maximize on-time delivery performance
From MaRDI portal
Recommendations
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
- Heuristics for parallel machine scheduling with delivery times
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
Cites work
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- A Genetic Algorithm for the Multiple-Choice Integer Program
- A genetic algorithm methodology for complex scheduling problems
- A hybrid genetic algorithm for the job shop scheduling problem
- A hybrid random-key genetic algorithm for a symmetric travelling salesman problem
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- A random key based genetic algorithm for the resource constrained project scheduling problem
- A random-key genetic algorithm for the generalized traveling salesman problem
- Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Feature Article—Genetic Algorithms for the Operations Researcher
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Genetic algorithms and tabu search: Hybrids for optimization
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Minimizing total completion time on a batch processing machine with job families
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
- Nonlinear Programming
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimization by simulated annealing
- Scheduling a batching machine
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling flexible flow lines with sequence-dependent setup times
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling with agreeable release times and due dates on a batch processing machine
- Scheduling with batching: A review
- The Batch Loading and Scheduling Problem
Cited in
(11)- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
- A survey of scheduling with parallel batch (p-batch) processing
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Scheduling on a single machine and parallel machines with batch deliveries and potential disruption
- Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
- Online batch scheduling on parallel machines with delivery times
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
This page was built for publication: Scheduling parallel-machine batch operations to maximize on-time delivery performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q341468)
