Minimizing total completion time on a batch processing machine with job families
From MaRDI portal
Publication:2367392
DOI10.1016/0167-6377(93)90030-KzbMath0771.90054MaRDI QIDQ2367392
Reha Uzsoy, Vijaya Chandru, Chung-Yee Lee
Publication date: 10 August 1993
Published in: Operations Research Letters (Search for Journal in Brave)
total completion timesemiconductor manufacturingpolynomial time complexitysingle batch processing machine
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39)
Related Items (49)
Minimizing due date related performance measures on two batch processing machines ⋮ Minimizing total completion time on a batch processing machine with job families ⋮ Minimizing total weighted tardiness on a single batch process machine with incompatible job families ⋮ Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals ⋮ Integrated scheduling on parallel batch processing machines with non-identical capacities ⋮ Integrated production and delivery on parallel batching machines ⋮ Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date ⋮ Mixed batch scheduling on identical machines ⋮ Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ Scheduling a batching machine with convex resource consumption functions ⋮ MIP formulations and heuristics for solving parallel batching problems ⋮ On the complexity of bi-criteria scheduling on a single batch processing machine ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Earliness and tardiness scheduling problems on a batch processor ⋮ Learning effective dispatching rules for batch processor scheduling ⋮ Scheduling with batching: A review ⋮ A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines ⋮ Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ Optimality conditions to the acyclic travelling salesman problem. ⋮ Minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING ⋮ Scheduling batches with simultaneous job processing for two-machine shop problems ⋮ Scheduling a single batch processing machine with non-identical job sizes ⋮ Mixed integer formulation to minimize makespan in a flow shop with batch processing machines ⋮ Dynamic scheduling of batch servers with compatible product families ⋮ Scheduling batch processing machines with incompatible job families ⋮ Minimizing number of tardy jobs on a batch processing machine with incompatible job families ⋮ Unnamed Item ⋮ Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families ⋮ STOCHASTIC BATCH SCHEDULING AND THE “SMALLEST VARIANCE FIRST” RULE ⋮ A PTAS for semiconductor burn-in scheduling ⋮ Dynamic scheduling of batch-processing machines with non-identical product sizes ⋮ Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed ⋮ Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ Adaptive scheduling of batch servers in flow shops ⋮ THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ Scheduling with agreeable release times and due dates on a batch processing machine ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Minimizing makespan on a single burn-in oven in semiconductor manufacturing ⋮ On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ Heuristic scheduling of jobs on a multi-product batch processing machine ⋮ Scheduling on a batch processing machine with split compatibility graphs ⋮ Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
Cites Work
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing total completion time on a batch processing machine with job families
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Waiting Time Distribution in a Poisson Queue with a General Bulk Service Rule
- A General Class of Bulk Queues with Poisson Input
- Optimal control of batch service queues
This page was built for publication: Minimizing total completion time on a batch processing machine with job families
