Scheduling batch processing machines with incompatible job families
From MaRDI portal
Publication:4399080
DOI10.1080/00207549508904839zbMATH Open0910.90180OpenAlexW2092068825MaRDI QIDQ4399080FDOQ4399080
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on Multiprocessing Timing Anomalies
- 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
- Efficient scheduling algorithms for a single batch processing machine
- The one-machine sequencing problem
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Scheduling a single batch processing machine with non-identical job sizes
- Minimizing total completion time on a batch processing machine with job families
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- Optimal control of batch service queues
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
Cited In (46)
- Scheduling job shops with batch machines using the Lagrangian relaxation technique
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
- Learning effective dispatching rules for batch processor scheduling
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
- Multiple orders per job batch scheduling with incompatible jobs
- Modelling and analysis of a multi-stage system involving batch processors with incompatible job families
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Exact methods for the oven scheduling problem
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- On the complexity of bi-criteria scheduling on a single batch processing machine
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Bin Packing Problem with Time Lags
- Two-stage hybrid flow shop scheduling with dynamic job arrivals
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Order consolidation for batch processing
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace
- Scheduling batches with simultaneous job processing for two-machine shop problems
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
- Batch machine production with perishability time windows and limited batch size
- Mixed batch scheduling on identical machines
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
- Earliness and tardiness scheduling problems on a batch processor
- A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Dynamic scheduling of batch servers with compatible product families
- Stochastic scheduling of a batch processing machine with incompatible job families
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- A survey of scheduling with parallel batch (p-batch) processing
- Scheduling with product family set-up times: an application in TFT LCD manufacturing
- Scheduling on a batch processing machine with split compatibility graphs
Recommendations
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families 👍 👎
- Scheduling a batch processing machine with non-identical job sizes 👍 👎
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection 👍 👎
- Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective 👍 👎
- Scheduling of incompatible jobs on unrelated machines 👍 👎
- Multiobjective scheduling of jobs with incompatible families on parallel batch machines 👍 👎
- Stochastic scheduling of a batch processing machine with incompatible job families 👍 👎
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Scheduling batch processing machines with incompatible job families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4399080)
