IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v22y2014i3p1062-1073.html
   My bibliography  Save this article

An integer linear formulation for the file transfer scheduling problem

Author

Listed:
  • Zorica Dražić
  • Aleksandar Savić
  • Vladimir Filipović

Abstract

In this paper, we propose a new integer linear programming (ILP) formulation for solving a file transfer scheduling problem (FTSP), which is to minimize the overall time needed to transfer all files to their destinations for a given collection of various sized files in a computer network. Each computer in this network has a limited number of communication ports. The described problem is proved to be NP-hard in a general case. Our formulation enables solving the problem by standard ILP solvers like CPLEX or Gurobi. To prove the validity of the proposed ILP formulation, two new reformulations of FTSP are presented. The results obtained by CPLEX and Gurobi solvers, based on this formulation, are presented and discussed. Copyright Sociedad de Estadística e Investigación Operativa 2014

Suggested Citation

  • Zorica Dražić & Aleksandar Savić & Vladimir Filipović, 2014. "An integer linear formulation for the file transfer scheduling problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(3), pages 1062-1073, October.
    • Handle: RePEc:spr:topjnl:v:22:y:2014:i:3:p:1062-1073
    DOI: 10.1007/s11750-013-0312-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-013-0312-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-013-0312-x?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.

    References listed on IDEAS

    as
    1. Hanif Sherali & J. Smith, 2012. "Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 173-189, April.
    2. Luís Gouveia & Pedro Moura, 2012. "Enhancing discretized formulations: the knapsack reformulation and the star reformulation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 52-74, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bernard Gendron & Luis Gouveia, 2017. "Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 51(2), pages 629-649, May.
    2. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    3. Gouveia, Luís & Lopes, Maria João & de Sousa, Amaro, 2015. "Single PON network design with unconstrained splitting stages," European Journal of Operational Research, Elsevier, vol. 240(2), pages 361-371.

    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:topjnl:v:22:y:2014:i:3:p:1062-1073. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.