Solving single batch-processing machine problems using an iterated heuristic

DOI10.1080/00207543.2010.518995MaRDI QIDQ3019221zbMATH OpenOpenAlexFDO

Authors Huimei Wang

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

zbMATH Keywords

batch-processing machineschedulingtotal weighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 5149339
• A single machine batch scheduling problem with bounded batch size
• scientific article; zbMATH DE number 1792073
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• One-pass batching algorithms for the one-machine problem
• A heuristic algorithm for Flow Shop problem in batch processing
• Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
• scientific article; zbMATH DE number 5671136
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints

Cites work

• A General Class of Bulk Queues with Poisson Input
• A new dynamic look-ahead scheduling procedure for batching machines
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling a single batch processing machine with non-identical job sizes

Cited in

(12)

• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
• 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
• Column generation for minimizing total completion time in a parallel-batching environment
• A survey of scheduling with parallel batch (p-batch) processing
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme
• Just-in-time single-batch-processing machine scheduling
• Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
• Split-merge: using exponential neighborhood search for scheduling a batching machine
• scientific article; zbMATH DE number 5149339 (Why is no real title available?)
• Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
• Exact approaches for single machine total weighted tardiness batch scheduling
• Batch processing machine scheduling problems using a self-adaptive approach based on dynamic programming

This page was built for publication: Solving single batch-processing machine problems using an iterated heuristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3019221)