Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
From MaRDI portal
Publication:5478853
DOI10.1080/00207540500525254zbMath1095.90039OpenAlexW2005640849MaRDI QIDQ5478853
No author found.
Publication date: 13 July 2006
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540500525254
Related Items (22)
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 ⋮ An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes ⋮ Split-merge: using exponential neighborhood search for scheduling a batching machine ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ A hybrid neural network approach to minimize total completion time on a single batch processing machine ⋮ A particle swarm optimizer for grouping problems ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Solving single batch-processing machine problems using an iterated heuristic ⋮ Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ Grouping evolution strategies: an effective approach for grouping problems ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes ⋮ Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes ⋮ Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs ⋮ A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes ⋮ The Find-Fix-Finish-Exploit-Analyze (F3EA) Meta-Heuristic Algorithm with an Extended Constraint Handling Technique for Constrained Optimization
Cites Work
- Minimizing number of tardy jobs on a batch processing machine with 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
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- 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
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
