IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v9y2015i1p101-125.html
   My bibliography  Save this article

Grid scheduling by bilevel programming: a heuristic approach

Author

Listed:
  • Lucio Bianco
  • Massimiliano Caramia
  • Stefano Giordani
  • Renato Mari

Abstract

We study the following grid scheduling problem. A set of independent tasks, submitted to a grid external scheduler (ES), has to be assigned to a set of grid computing sites, each one controlled by a local scheduler (LS), for their execution. With each task are associated a release date and a due-date. If the due-date is exceeded, a penalty cost proportional to the tardiness must be paid. If this cost is too high, the ES could prefer to reject the task paying a rejection cost. Indeed, the ES wants to minimise the total cost for rejecting or delaying tasks, while each LS wants to maximise the computational resource usage efficiency. Thus, the problem is modelled by means of bilevel programming, where the decisions of the ES is constrained by those of the LSs, and vice versa. We propose a heuristic algorithm to solve large size instances. Computational results are presented and discussed. [Received 10 October 2012; Revised 19 March 2013; Accepted 30 June 2013]

Suggested Citation

  • Lucio Bianco & Massimiliano Caramia & Stefano Giordani & Renato Mari, 2015. "Grid scheduling by bilevel programming: a heuristic approach," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 9(1), pages 101-125.
    • Handle: RePEc:ids:eujine:v:9:y:2015:i:1:p:101-125
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=67450
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:eujine:v:9:y:2015:i:1:p:101-125. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.