Advanced Search
MyIDEAS: Login

Scheduling jobs with release dates and tails on identical machines to minimize the makespan


Author Info

  • Carlier, Jacques
Registered author(s):


    No abstract is available for this item.

    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): 29 (1987)
    Issue (Month): 3 (June)
    Pages: 298-306

    as in new window
    Handle: RePEc:eee:ejores:v:29:y:1987:i:3:p:298-306

    Contact details of provider:
    Web page:

    Related research



    No references listed on IDEAS
    You can help add them by filling out this form.


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

    Cited by:
    1. Chatterjee A K & Mukherjee, Saral, . "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Koulamas, Christos & Kyparisis, George J., 2004. "Makespan minimization on uniform parallel machines with release times," European Journal of Operational Research, Elsevier, vol. 157(1), pages 262-266, August.
    3. Ivens, Philip & Lambrecht, Marc, 1996. "Extending the shifting bottleneck procedure to real-life applications," European Journal of Operational Research, Elsevier, vol. 90(2), pages 252-268, April.
    4. Raaymakers, W. H. M. & Hoogeveen, J. A., 2000. "Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing," European Journal of Operational Research, Elsevier, vol. 126(1), pages 131-151, October.
    5. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    6. Kis, Tamas & Pesch, Erwin, 2005. "A review of exact solution methods for the non-preemptive multiprocessor flowshop problem," European Journal of Operational Research, Elsevier, vol. 164(3), pages 592-608, August.
    7. Zribi, N. & El Kamel, A. & Borne, P., 2008. "Minimizing the makespan for the MPM job-shop with availability constraints," International Journal of Production Economics, Elsevier, vol. 112(1), pages 151-160, March.
    8. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Computational Statistics, Springer, vol. 64(1), pages 107-124, August.


    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:29:y:1987:i:3:p:298-306. 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.