Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems

DOI10.1007/s11766-998-0055-xzbMath0936.68014OpenAlexW2395535127MaRDI QIDQ1288217

Guochun Tang, Les R. Foulds

Publication date: 18 May 2000

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-998-0055-x

zbMATH Keywords

single machine scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs

Cites Work

• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine

This page was built for publication: Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems