A PTAS for semiconductor burn-in scheduling

DOI10.1007/s10878-005-5480-7zbMath1066.90141OpenAlexW2048666070MaRDI QIDQ1774521

Haodi Feng, Benyun Shi, Xiaotie Deng, Guo Jun Li

Publication date: 17 May 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-5480-7

zbMATH Keywords

approximation algorithmrelease datebatch processinggeometric roundingtime stretching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Statistical mechanics of semiconductors (82D37)

Related Items (13)

Parallel batch scheduling with nested processing set restrictions ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Scheduling jobs with sizes and delivery times on identical parallel batch machines ⋮ The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Minimizing makespan on a single batching machine with release times and non-identical job sizes ⋮ Minimizing makespan with release times on identical parallel batching machines ⋮ Scheduling hybrid flowshop with parallel batching machines and compatibilities ⋮ Scheduling jobs with release dates on parallel batch processing machines ⋮ A PTAS for parallel batch scheduling with rejection and dynamic job arrivals ⋮ MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES ⋮ Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine

Cites Work

• Unnamed Item
• Scheduling a batching machine
• On-line scheduling a batch processing system to minimize total weighted job completion time
• Minimizing mean completion time in a batch processing system
• Minimizing total completion time on a batch processing machine with job families
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

This page was built for publication: A PTAS for semiconductor burn-in scheduling