A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
From MaRDI portal
Publication:941534
DOI10.1016/j.cor.2006.07.005zbMath1180.90126MaRDI QIDQ941534
Behrooz Karimi, Ali Husseinzadeh Kashan, Masoud Jenabi
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.07.005
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations, Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes, Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility, A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes, A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival, An autonomous vehicle sequencing problem at intersections: A genetic algorithm approach, Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
Cites Work
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- Scheduling with agreeable release times and due dates on a batch processing machine
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Minimizing total completion time on a batch processing machine with job families
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Scheduling with Deadlines and Loss Functions
- The Batch Loading and Scheduling Problem
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Bounds on Multiprocessing Timing Anomalies
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
