Minimizing makespan on a single burn-in oven in semiconductor manufacturing
From MaRDI portal
Publication:1579492
DOI10.1016/S0377-2217(98)00391-9zbMath0971.90033OpenAlexW1994027672MaRDI QIDQ1579492
Publication date: 30 January 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00391-9
branch-and-bound algorithmheuristicsschedulingmakespanbatch processing machinemaximum completion timesemiconductor manufacturingstatic casedynamic casesingle burn-in oven
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Related Items (32)
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 ⋮ Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals ⋮ Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint ⋮ An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes ⋮ Scheduling parallel-machine batch operations to maximize on-time delivery performance ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date ⋮ When serial batch scheduling involves parallel batching decisions: a branch and price scheme ⋮ Just-in-time single-batch-processing machine scheduling ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices ⋮ Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches ⋮ Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ Realistic two-stage flowshop batch scheduling problems with transportation capacity and times ⋮ A makespan minimization problem for versatile developers in the game industry ⋮ MIP formulations and heuristics for solving parallel batching problems ⋮ Scheduling batch processing machine using max-min ant system algorithm improved by a local search method ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Solving single batch-processing machine problems using an iterated heuristic ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ Makespan minimization on single batch-processing machine via ant colony optimization ⋮ Mixed integer formulation to minimize makespan in a flow shop with batch processing machines ⋮ A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately ⋮ 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 ⋮ Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes ⋮ A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
Cites Work
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing total completion time on a batch processing machine with job families
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling a single batch processing machine with non-identical job sizes
- The use of upstream and downstream information in scheduling semiconductor batch operations
- Scheduling batch processing machines with incompatible job families
- Scheduling Groups of Jobs on a Single Machine
- A General Class of Bulk Queues with Poisson Input
- Optimal control of batch service queues
This page was built for publication: Minimizing makespan on a single burn-in oven in semiconductor manufacturing
