Scheduling batch processing machines with incompatible job families
From MaRDI portal
Publication:4399080
DOI10.1080/00207549508904839zbMath0910.90180OpenAlexW2092068825MaRDI QIDQ4399080
Publication date: 30 March 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549508904839
Related Items
Minimizing total weighted tardiness on a single batch process machine with incompatible job families ⋮ On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs ⋮ 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 ⋮ Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom ⋮ Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace ⋮ A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families ⋮ Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach ⋮ Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication ⋮ Scheduling job shops with batch machines using the Lagrangian relaxation technique ⋮ A constraint programming approach for a batch processing problem with non-identical job sizes ⋮ Exact methods for the oven scheduling problem ⋮ Bin Packing Problem with Time Lags ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Mixed batch scheduling on identical machines ⋮ Batch machine production with perishability time windows and limited batch size ⋮ On the complexity of bi-criteria scheduling on a single batch processing machine ⋮ Earliness and tardiness scheduling problems on a batch processor ⋮ Learning effective dispatching rules for batch processor scheduling ⋮ Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families ⋮ Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem ⋮ Multiple orders per job batch scheduling with incompatible jobs ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ Online scheduling on unbounded parallel-batch machines with incompatible job families ⋮ A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals ⋮ Scheduling batches with simultaneous job processing for two-machine shop problems ⋮ Two-stage hybrid flow shop scheduling with dynamic job arrivals ⋮ Dynamic scheduling of batch servers with compatible product families ⋮ Minimizing number of tardy jobs on a batch processing machine with incompatible job families ⋮ Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families ⋮ Scheduling with product family set-up times: an application in TFT LCD manufacturing ⋮ Order consolidation for batch processing ⋮ Dynamic scheduling of batch-processing machines with non-identical product sizes ⋮ Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed ⋮ A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival ⋮ Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times ⋮ Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Minimizing makespan on a single burn-in oven in semiconductor manufacturing ⋮ Scheduling on a batch processing machine with split compatibility graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient scheduling algorithms for a single batch processing machine
- The one-machine sequencing problem
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Minimizing total completion time on a batch processing machine with job families
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Scheduling a single batch processing machine with non-identical job sizes
- Bounds on Multiprocessing Timing Anomalies
- Optimal control of batch service queues
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
