Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case

DOI10.1007/S11766-999-0057-3zbMath0933.68015OpenAlexW2092990304MaRDI QIDQ1288289

Guochun Tang, Les R. Foulds

Publication date: 11 May 1999

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

Full work available at URL: https://doi.org/10.1007/s11766-999-0057-3

zbMATH Keywords

machine scheduling problem

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)

Scheduling with controllable processing times and compression costs using population-based heuristics

Cites Work

• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• Worst-Case Analysis of Heuristic Algorithms
• 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: Heuristics for the general case