IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v96y2000i1p255-26910.1023-a1018939132489.html
   My bibliography  Save this article

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

Author

Listed:
  • Caroline Privault
  • Gerd Finke

Abstract

The classical k-server problem has been widely used to model two-level memory systems (e.g., paging and caching). The problem is to plan the movements of k mobile servers on the vertices of a graph under an on-line sequence of requests. We generalize this model in order to process a sequence of bulk requests and formulate, in this way, a valid model for the usual two-level tooling configuration in automated production systems. A slight adaptation of the so-called Partitioning Algorithm provides an on-line algorithm for this more general case, preserving basically the same competitive properties as the classical model. This approach yields a new tool management procedure in manufacturing which outperforms in its quality the usual methods that are based on heuristics for the traveling salesman problem. Copyright Kluwer Academic Publishers 2000

Suggested Citation

  • Caroline Privault & Gerd Finke, 2000. "k-server problems with bulk requests: an application to tool switching in manufacturing," Annals of Operations Research, Springer, vol. 96(1), pages 255-269, November.
    • Handle: RePEc:spr:annopr:v:96:y:2000:i:1:p:255-269:10.1023/a:1018939132489
    DOI: 10.1023/A:1018939132489
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018939132489
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018939132489?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Calmels, Dorothea, 2022. "An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 297(1), pages 66-85.
    2. Catanzaro, Daniele & Gouveia, Luis & Labbé, Martine, 2015. "Improved integer linear programming formulations for the job Sequencing and tool Switching Problem," European Journal of Operational Research, Elsevier, vol. 244(3), pages 766-777.
    3. Furrer, Martina & Mütze, Torsten, 2017. "An algorithmic framework for tool switching problems with multiple objectives," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1003-1016.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:96:y:2000:i:1:p:255-269:10.1023/a:1018939132489. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.