Scheduling on a single processor with variable speed

DOI10.1016/S0020-0190(96)00132-9zbMath0900.68041MaRDI QIDQ673343

Ahmad Ahmadian, Bahram Alidaee

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsMakespanSingle processorSum of deviations of jobs completion timesTotal flow timeTransportation problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling jobs with varying processing times
• Complexity of scheduling tasks with time-dependent execution times
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• Scheduling Deteriorating Jobs on a Single Processor
• A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
• Scheduling deteriorating jobs on a single machine to minimize the maximum processing times

This page was built for publication: Scheduling on a single processor with variable speed