Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
From MaRDI portal
Publication:4022933
Recommendations
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- 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
- Scheduling with agreeable release times and due dates on a batch processing machine
Cited in
(only showing first 100 items - show all)- Online scheduling on a parallel batch machine with delivery times and limited restarts
- Makespan minimization on single batch-processing machine via ant colony optimization
- Scheduling algorithms for a semiconductor probing facility
- Heuristic scheduling of jobs on a multi-product batch processing machine
- Scheduling parallel-machine batch operations to maximize on-time delivery performance
- Split-merge: using exponential neighborhood search for scheduling a batching machine
- Earliness and tardiness scheduling problems on a batch processor
- Bi-criteria scheduling on a single parallel-batch machine
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
- Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- Bounded parallel-batching scheduling with two competing agents
- Unbounded parallel-batching scheduling with two competitive agents
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- Just-in-time single-batch-processing machine scheduling
- A note on unbounded parallel-batch scheduling
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Parallel batch scheduling with nested processing set restrictions
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
- Dynamic scheduling of batch servers with compatible product families
- Parallel-batch scheduling with deterioration and rejection on a single machine
- Online batch scheduling on parallel machines with delivery times
- Bicriterion scheduling with equal processing times on a batch processing machine
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Unbounded parallel-batch scheduling with drop-line tasks
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- Controlling job arrivals with processing time windows into batch processor buffer
- Scheduling with agreeable release times and due dates on a batch processing machine
- A survey of scheduling with parallel batch (p-batch) processing
- A coordination mechanism for a scheduling game with parallel-batching machines
- Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch 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
- Minimizing makespan with release times on identical parallel batching machines
- Adaptive scheduling of batch servers in flow shops
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
- Minimizing total completion time on a batch processing machine with job families
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
- Realistic two-stage flowshop batch scheduling problems with transportation capacity and times
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Scheduling on a batch processing machine with split compatibility graphs
- Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- On lower and upper bounds for single machine parallel batch scheduling
- Single-machine batch scheduling with job processing time compatibility
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
- Arc-flow approach for single batch-processing machine scheduling
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
- Batch scheduling with proportional-linear deterioration and outsourcing
- A new dynamic look-ahead scheduling procedure for batching machines
- Learning-based multi-objective evolutionary algorithm for batching decision problem
- Single machine batch scheduling with release times
- Semiconductor final-test scheduling under setup operator constraints
- Logic-based Benders decomposition for scheduling a batching machine
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- 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
- Online unbounded batch scheduling on parallel machines with delivery times
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Learning effective dispatching rules for batch processor scheduling
- Optimal online-list batch scheduling
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Best semi-online algorithms for unbounded parallel batch scheduling
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Online batch scheduling with kind release times and incompatible families to minimize makespan
- Optimal on-line algorithms for one batch machine with grouped processing times
- Online over time scheduling on parallel-batch machines: a survey
This page was built for publication: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022933)
