Two FPTAS algorithms of problem 1|r_j, dm|C_+TPC

MaRDI QIDQ3445646zbMATH OpenFDO

Authors Ruiyang Zhou, Zhigang Cao, Yuzhong Zhang

Publication date 12 June 2007

Full work available at URL http://en.cnki.com.cn/Article_en/CJFDTotal-LYDS200604009.htm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling with discretely controllable processing times
• scientific article; zbMATH DE number 2089208
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
• scientific article; zbMATH DE number 1870508
• A survey of results for sequencing problems with controllable processing times

Cited in

(1)

• scientific article; zbMATH DE number 1226311 (Why is no real title available?)

This page was built for publication: Two FPTAS algorithms of problem \(1|r_j\), dm\(|C_{\max}+TPC\)

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