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

DOI10.1007/s11766-998-0054-yzbMath0927.68008OpenAlexW2118639448MaRDI QIDQ1288216

Guochun Tang, Les R. Foulds

Publication date: 20 July 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-998-0054-y

zbMATH Keywords

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 (3)

Scheduling with controllable processing times and compression costs using population-based heuristics ⋮ Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems ⋮ Single machine scheduling with controllable processing times and compression costs. II: Heuristics for the general case

Cites Work

• A survey of results for sequencing problems with controllable processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs