Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
From MaRDI portal
Publication:4022933
DOI10.1287/opre.40.4.764zbMath0759.90046OpenAlexW2111001493MaRDI QIDQ4022933
Chung-Yee Lee, Louis A. Martin-Vega, Reha Uzsoy
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
heuristicsbatch processing machinesworst case error boundsparallel identical batch processingscheduling semiconductor burn-in operations
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39)
Related Items (only showing first 100 items - show all)
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 ⋮ Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times ⋮ Integrated scheduling on parallel batch processing machines with non-identical capacities ⋮ Integrated scheduling problem on a single bounded batch machine with an unavailability constraint ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ 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 ⋮ Exact methods for the oven scheduling problem ⋮ Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices ⋮ 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 ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Single machine unbounded parallel-batch scheduling with forbidden intervals ⋮ Realistic two-stage flowshop batch scheduling problems with transportation capacity and times ⋮ Batch-size-based rearrangement of the shop floor into mini-lines ⋮ 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 ⋮ Learning effective dispatching rules for batch processor scheduling ⋮ Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem ⋮ OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING ⋮ Minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ Solving single batch-processing machine problems using an iterated heuristic ⋮ ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING ⋮ Scheduling batches with simultaneous job processing for two-machine shop problems ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ Scheduling a single batch processing machine with non-identical job sizes ⋮ Minimizing makespan on a single batching machine with release times and non-identical job sizes ⋮ Dynamic scheduling of batch servers with compatible product families ⋮ Scheduling batch processing machines with incompatible job families ⋮ Integrated design approach for virtual production line-based reconfigurable manufacturing systems ⋮ Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families ⋮ A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately ⋮ Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching ⋮ Dynamic scheduling of batch-processing machines with non-identical product sizes ⋮ Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes ⋮ Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed ⋮ A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines ⋮ Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure ⋮ A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines ⋮ Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness ⋮ Scheduling a proportionate flow shop of batching machines ⋮ Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times ⋮ Adaptive scheduling of batch servers in flow shops ⋮ Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines ⋮ THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE ⋮ The master-slave paradigm in parallel computer and industrial settings ⋮ MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes ⋮ On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM ⋮ Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine ⋮ Single-machine batch scheduling with job processing time compatibility ⋮ Heuristic scheduling of jobs on a multi-product batch processing machine ⋮ Scheduling on a batch processing machine with split compatibility graphs ⋮ Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times ⋮ Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs ⋮ An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart ⋮ Online unbounded batch scheduling on parallel machines with delivery times ⋮ Minimizing due date related performance measures on two batch processing machines ⋮ Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine ⋮ Integrated production and transportation on parallel batch machines to minimize total weighted delivery time ⋮ Minimizing total weighted tardiness on a single batch process machine with incompatible job families ⋮ On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs ⋮ Online scheduling on a parallel batch machine with delivery times and limited restarts ⋮ A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes ⋮ A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times ⋮ Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals ⋮ Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Integrated production and delivery on parallel batching machines ⋮ The lockmaster's problem ⋮ Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes ⋮ 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 ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Split-merge: using exponential neighborhood search for scheduling a batching machine ⋮ Competitive project scheduling on two unbounded parallel batch machines ⋮ The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ 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 ⋮ Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives ⋮ 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 ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ Batch sequencing and cooperation ⋮ Optimal on-line algorithms for one batch machine with grouped processing times ⋮ Parallel-batch scheduling with deterioration and rejection on a single machine ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Mixed batch scheduling on identical machines ⋮ 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
This page was built for publication: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
