Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

DOI10.1287/OPRE.45.6.874zbMATH Open0895.90116OpenAlexW2105821629MaRDI QIDQ4384087FDOQ4384087

Authors: Dorit S. Hochbaum, Dan Landy 

Publication date: 20 September 1998

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1974e275442c883fd1dc8fccf0083c8cd7b14638

Recommendations

• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
• Scheduling a burn-in oven with non-agreeable release times and due dates

zbMATH Keywords

semiconductor manufacturingpolynomial heuristicbatch-processingburn-in stage

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Dynamic programming (90C39) Production models (90B30)

Cited In (51)

• Batch processing with interval graph compatibilities between tasks
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING
• Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
• Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• A stochastic batching and scheduling problem
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
• Capacitated max-batching with interval graph compatibilities
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
• Job scheduling of diffusion furnaces in semiconductor fabrication facilities
• Scheduling with batching: A review
• Adaptive feasible and infeasible tabu search for weighted vertex coloring
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
• Integrated production and delivery on parallel batching machines
• A PTAS for semiconductor burn-in scheduling
• Scheduling a burn-in oven with non-agreeable release times and due dates
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Models and heuristic algorithms for a weighted vertex coloring problem
• Analysis of finite-buffer state-dependent bulk queues
• Model approximation for batch flow shop scheduling with fixed batch sizes
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• The coordination of transportation and batching scheduling
• Minimizing due date related performance measures on two batch processing machines
• Mixed batch scheduling on identical machines
• Batch scheduling of nonidentical job sizes with minsum criteria
• Scheduling parallel-machine batch operations to maximize on-time delivery performance
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• Scheduling a batching machine with convex resource consumption functions
• Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
• Bounded parallel-batching scheduling with two competing agents
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• Two-stage flowshop scheduling problems with identical and batch processors
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
• Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\)
• A survey of scheduling with parallel batch (p-batch) processing
• Scheduling with agreeable release times and due dates on a batch processing machine
• Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
• An efficient PTAS for semiconductor burn-in scheduling with release dates to minimize maximum delivery time
• Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
• On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
• Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints
• Single-machine batch scheduling with job processing time compatibility
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

This page was built for publication: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

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