Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
From MaRDI portal
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)- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Single machine parallel-batch scheduling with deteriorating jobs
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- On-line scheduling with delivery time on a single batch machine
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- Scheduling with agreeable release times and due dates on a batch processing machine
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Scheduling one batch processor subject to job release dates
- A new dynamic look-ahead scheduling procedure for batching machines
- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Competitive project scheduling on two unbounded parallel batch machines
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families
- Online batch scheduling with kind release times and incompatible families to minimize makespan
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- Makespan minimization on single batch-processing machine via ant colony optimization
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- Order consolidation for batch processing
- Minimizing makespan with release times on identical parallel batching machines
- On-line scheduling algorithms for a batch machine with finite capacity
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- On scheduling an unbounded batch machine
- Minimizing due date related performance measures on two batch processing machines
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- Earliness and tardiness scheduling problems on a batch processor
- Scheduling with batching: A review
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- Batch scheduling with proportional-linear deterioration and outsourcing
- Single machine batch scheduling with two non-disjoint agents and splitable jobs
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs
- A survey of scheduling with parallel batch (p-batch) processing
- On lower and upper bounds for single machine parallel batch scheduling
- Learning-based multi-objective evolutionary algorithm for batching decision problem
- Online scheduling on a parallel batch machine with delivery times and limited restarts
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- Parallel-batch scheduling with deterioration and rejection on a single machine
- Mixed batch scheduling on identical machines
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Unbounded parallel-batch scheduling with drop-line tasks
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
- Logic-based Benders decomposition for scheduling a batching machine
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- Single-machine batch scheduling with job processing time compatibility
- Online unbounded batch scheduling on parallel machines with delivery times
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- Minimizing total completion time on a batch processing machine with job families
- Parallel batch scheduling with nested processing set restrictions
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints
- Realistic two-stage flowshop batch scheduling problems with transportation capacity and times
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- The master-slave paradigm in parallel computer and industrial settings
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
- Scheduling on a batch processing machine with split compatibility graphs
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
- Arc-flow approach for single batch-processing machine scheduling
- Semiconductor final-test scheduling under setup operator constraints
- Just-in-time single-batch-processing machine scheduling
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
- Batch-size-based rearrangement of the shop floor into mini-lines
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Solving single batch-processing machine problems using an iterated heuristic
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- Coordinated multistage scheduling of parallel batch-processing machines under multiresource constraints
- Integrated production and delivery on parallel batching machines
- The lockmaster's problem
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
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)
