Advanced Search
MyIDEAS: Login to save this article or follow this journal

Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation


Author Info

  • Waligóra, Grzegorz
Registered author(s):


    Problems of scheduling non-preemptable, independent jobs on parallel identical machines under an additional continuous renewable resource to minimize the makespan are considered. Each job simultaneously requires for its processing a machine and an amount (unknown in advance) of the continuous resource. The processing rate of a job depends on the amount of the resource allotted to this job at a time. The problem is to find a sequence of jobs on machines and, simultaneously, a continuous resource allocation that minimize the makespan. A heuristic procedure for allocating the continuous resource is used. The tabu search metaheuristic to solve the considered problem is presented. The results produced by tabu search are compared with optimal solutions for small instances, as well as with the results generated by simple search methods - multi-start iterative improvement and random sampling for larger instances.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 193 (2009)
    Issue (Month): 3 (March)
    Pages: 849-856

    as in new window
    Handle: RePEc:eee:ejores:v:193:y:2009:i:3:p:849-856

    Contact details of provider:
    Web page:

    Related research

    Keywords: Scheduling Discrete-continuous scheduling problems Tabu search;


    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Jozefowska, Joanna & Waligora, Grzegorz & Weglarz, Jan, 2002. "Tabu list management methods for a discrete-continuous scheduling problem," European Journal of Operational Research, Elsevier, vol. 137(2), pages 288-302, March.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:
    1. He, Zhengwen & Liu, Renjing & Jia, Tao, 2012. "Metaheuristics for multi-mode capital-constrained project payment scheduling," European Journal of Operational Research, Elsevier, vol. 223(3), pages 605-613.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:193:y:2009:i:3:p:849-856. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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