Solving single batch-processing machine problems using an iterated heuristic
From MaRDI portal
Publication:3019221
DOI10.1080/00207543.2010.518995zbMath1217.90113OpenAlexW2007597483MaRDI QIDQ3019221
Publication date: 27 July 2011
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207543.2010.518995
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ Split-merge: using exponential neighborhood search for scheduling a batching machine ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ When serial batch scheduling involves parallel batching decisions: a branch and price scheme ⋮ Just-in-time single-batch-processing machine scheduling ⋮ 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 ⋮ Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm ⋮ Column generation for minimizing total completion time in a parallel-batching environment ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- A new dynamic look-ahead scheduling procedure for batching machines
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling a single batch processing machine with non-identical job sizes
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- A General Class of Bulk Queues with Poisson Input
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Solving single batch-processing machine problems using an iterated heuristic
