A heuristic algorithm for minimizing mean flow time with unit setups
From MaRDI portal
Publication:1603400
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)
Related Items
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
