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

DOI10.1023/A:1018939132489MaRDI QIDQ1593540zbMATH OpenFDO

Authors 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

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

Recommendations

• Competitive algorithms for server problems
• New Ressults on Server Problems
• A competitive 2-server algorithm
• On the k -server conjecture
• An application of various algorithms for solving the \(k\)-server problem

Cited in

(6)

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

This page was built for publication: \(k\)-server problems with bulk requests: an application to tool switching in manufacturing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593540)