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)- 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
- A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
- Solving single batch-processing machine problems using an iterated heuristic
- Scheduling a proportionate flow shop of batching machines
- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- The coordination of scheduling and batch deliveries
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- Scheduling one batch processor subject to job release dates
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
- Exact methods for the oven scheduling problem
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Scheduling with batching: A review
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Batching-based approaches for optimized packing of jobs in the spatial scheduling problem
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- 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
- On scheduling an unbounded batch machine
- A coordination mechanism for a scheduling game with uniform-batching machines
- Batching decisions for assembly production systems
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Integrated production and delivery on parallel batching machines
- Integrated scheduling on parallel batch processing machines with non-identical capacities
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
- Batch sequencing and cooperation
- Order consolidation for batch processing
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Competitive project scheduling on two unbounded parallel batch machines
- Integrated design approach for virtual production line-based reconfigurable manufacturing systems
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
- The lockmaster's problem
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
- OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- Single machine batch scheduling with two non-disjoint agents and splitable jobs
- On-line scheduling algorithms for a batch machine with finite capacity
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- Scheduling batches with simultaneous job processing for two-machine shop problems
- An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
- Batch-size-based rearrangement of the shop floor into mini-lines
- Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
- Parallel batch scheduling of equal-length jobs with release and due dates
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Scheduling unrelated parallel batch processing machines with non-identical job sizes
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Single machine parallel-batch scheduling with deteriorating jobs
- On-line scheduling with delivery time on a single batch machine
- Batch machine production with perishability time windows and limited batch size
- Minimizing due date related performance measures on two batch processing machines
- Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time
- Mixed batch scheduling on identical machines
- The master-slave paradigm in parallel computer and industrial settings
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)
