Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

DOI10.1287/OPRE.40.4.764zbMATH Open0759.90046OpenAlexW2111001493MaRDI QIDQ4022933FDOQ4022933

Authors: Chung-Yee Lee, Reha Uzsoy, Louis A. Martin-Vega 

Publication date: 17 January 1993

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

Full work available at URL: https://doi.org/10.1287/opre.40.4.764

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

zbMATH Keywords

heuristicsbatch processing machinesworst case error boundsparallel identical batch processingscheduling semiconductor burn-in operations

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Production models (90B30)

Cited In (only showing first 100 items - show all)

• A new dynamic look-ahead scheduling procedure for batching machines
• 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
• Learning effective dispatching rules for batch processor scheduling
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
• A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
• Optimal online-list batch scheduling
• 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
• 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
• Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
• An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
• A coordination mechanism for a scheduling game with uniform-batching machines
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
• An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
• Competitive project scheduling on two unbounded parallel batch machines
• 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 shortest first coordination mechanism for a scheduling game with parallel-batching machines
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
• Minimizing due date related performance measures on two batch processing machines
• The master-slave paradigm in parallel computer and industrial settings
• Batch machine production with perishability time windows and limited batch size
• Heuristic scheduling of jobs on a multi-product batch processing machine
• Online scheduling on a parallel batch machine with delivery times and limited restarts
• Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time
• Earliness and tardiness scheduling problems on a batch processor
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• Scheduling hybrid flowshop with parallel batching machines and compatibilities
• OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• Just-in-time single-batch-processing machine scheduling
• Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
• Parallel-batch scheduling with deterioration and rejection on a single machine
• Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
• Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
• On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
• Scheduling on a batch processing machine with split compatibility graphs
• 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
• Arc-flow approach for single batch-processing machine scheduling
• 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
• Batch scheduling with proportional-linear deterioration and outsourcing
• Learning-based multi-objective evolutionary algorithm for batching decision problem
• Logic-based Benders decomposition for scheduling a batching machine
• Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times
• Exact methods for the oven scheduling problem
• A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
• A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
• Batching-based approaches for optimized packing of jobs in the spatial scheduling problem
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
• 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
• Integrated scheduling on parallel batch processing machines with non-identical capacities
• Order consolidation for batch processing
• Integrated design approach for virtual production line-based reconfigurable manufacturing systems
• OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
• Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
• A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
• Batch-size-based rearrangement of the shop floor into mini-lines
• Mixed batch scheduling on identical machines
• Unbounded parallel-batch scheduling with family jobs and delivery coordination
• Dynamic scheduling of batch servers with compatible product families
• Parallel batch scheduling with nested processing set restrictions
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
• Unbounded parallel-batch scheduling with drop-line tasks
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine
• A survey of scheduling with parallel batch (p-batch) processing
• Adaptive scheduling of batch servers in flow shops
• 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
• Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
• Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
• A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
• On lower and upper bounds for single machine parallel batch 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
• Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
• Semiconductor final-test scheduling under setup operator constraints
• Single machine batch scheduling with release times
• Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
• Online unbounded batch scheduling on parallel machines with delivery times
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling batch processing machines with incompatible job families
• Best semi-online algorithms for unbounded parallel batch scheduling
• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Optimal on-line algorithms for one batch machine with grouped processing times
• A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
• Solving single batch-processing machine problems using an iterated heuristic

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)