scientific article; zbMATH DE number 1271637

MaRDI QIDQ4238767zbMATH OpenFDO

Authors Wanzhen Huang, Feng Zhang

Publication date 30 March 1999

zbMATH Keywords

controllable processing timescrash activitiespolynomial-time algorithmsingle-machine scheduling problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• A survey of results for sequencing problems with controllable processing times
• Some comments on sequencing with controllable processing times
• Two parallel machine sequencing problems involving controllable job processing times

Cited in

(5)

• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• scientific article; zbMATH DE number 1051019 (Why is no real title available?)
• scientific article; zbMATH DE number 764420 (Why is no real title available?)
• scientific article; zbMATH DE number 834592 (Why is no real title available?)
• A 32-approximation algorithm for parallel machine scheduling with controllable processing times

This page was built for publication:

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