A heuristic algorithm for minimizing mean flow time with unit setups

DOI10.1016/S0020-0190(01)00136-3zbMath1032.68026WikidataQ57633951 ScholiaQ57633951MaRDI QIDQ1603400

Frank Werner, Svetlana A. Kravchenko

Publication date: 14 July 2002

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

zbMATH Keywords

SchedulingHeuristic algorithmParallel machinesSingle server

Mathematics Subject Classification ID

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

Related Items (6)

Total completion time minimization in a computer system with a server and two parallel processors ⋮ A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server ⋮ Scheduling jobs with equal processing times and a single server on parallel identical machines ⋮ Minimizing total weighted completion time approximately for the parallel machine problem with a single server ⋮ A survey of scheduling problems with setup times or costs ⋮ Parallel machine scheduling with multiple unloading servers

Cites Work

• Parallel machine scheduling problems with a single server
• Parallel machine scheduling with a common server
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: A heuristic algorithm for minimizing mean flow time with unit setups