\(k\)-server problems with bulk requests: an application to tool switching in manufacturing

DOI10.1023/A:1018939132489zbMath0966.90030MaRDI QIDQ1593540

Caroline Privault, Gerd Finke

Publication date: 17 January 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

competitive analysispaging\(k\)-server problemson-line tool switching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Improved integer linear programming formulations for the job sequencing and tool switching problem, Improved heuristic algorithms for the job sequencing and tool switching problem, An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines, An algorithmic framework for tool switching problems with multiple objectives, Scheduling multi-colour print jobs with sequence-dependent setup times