An efficient PTAS for semiconductor burn-in scheduling with release dates to minimize maximum delivery time

MaRDI QIDQ5490459zbMATH OpenFDO

Authors Shaoqiang Zhang, Xirong Ma

Publication date 4 October 2006

zbMATH Keywords

batchschedulingpolynomial time approximation schemeburn-in

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• A PTAS for semiconductor burn-in scheduling
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Minimizing makespan with release times on identical parallel batching machines
• Computing and Combinatorics

Cited in

(1)

• A PTAS for semiconductor burn-in scheduling

This page was built for publication: An efficient PTAS for semiconductor burn-in scheduling with release dates to minimize maximum delivery time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490459)