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