Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families

DOI10.1080/00207540410001704041zbMath1060.90643OpenAlexW2092016688MaRDI QIDQ4671312

Pyung-Hoi Koo, Jae-Won Ha, Woon-Seek Lee, Shie-Gheun Koh

Publication date: 26 April 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540410001704041

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

An effective formulation for optimal scheduling of multistage multi-product batch plant based on due dates ⋮ Integrated production and transportation on parallel batch machines to minimize total weighted delivery time ⋮ Integrated scheduling on parallel batch processing machines with non-identical capacities ⋮ Integrated production and delivery on parallel batching machines ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families ⋮ A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ MILP models to minimise makespan in additive manufacturing machine scheduling problems ⋮ Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes ⋮ Dynamic scheduling of batch-processing machines with non-identical product sizes ⋮ A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival ⋮ Order acceptance using genetic algorithms ⋮ A survey of scheduling with parallel batch (p-batch) processing

Cites Work

• Efficient scheduling algorithms for a single batch processing machine
• Minimizing total completion time on a batch processing machine with job families
• The Batch Loading and Scheduling Problem
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Managing batch processors to reduce lead time in a semiconductor packaging line
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Control of a batch-processing machine: A computational approach
• 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
• Bounds on Multiprocessing Timing Anomalies