IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i3d10.1057_palgrave.jors.2600690.html
   My bibliography  Save this article

Sequencing with uncertain numerical data for makespan minimisation

Author

Listed:
  • T-C Lai

    (National Taiwan University)

  • Y N Sotskov

    (Belarusian Academy of Sciences)

Abstract

We consider a scheduling problem with the objective of minimising the makespan under uncertain numerical input data (for example, the processing time of an operation, the job release time and due date) and fixed structural input data (for example the precedence and capacity constraints). We assume that at (before) the scheduling stage the structural input data are known and fixed but all we know about the numerical input data are their upper and lower bounds, where the uncertain numerical data become realised at the control stage as the scheduled process evolves. After improving the mixed graph model, we present an approach for dealing with our scheduling problem under uncertain numerical data based on a stability analysis of an optimal makespan schedule. In particular, we investigate the candidate set of the critical paths in a circuit-free digraph, characterise a minimal set of the optimal schedules, and develop an optimal and a heuristic algorithm. We also report computational results for randomly generated as well as well-known test problems.

Suggested Citation

  • T-C Lai & Y N Sotskov, 1999. "Sequencing with uncertain numerical data for makespan minimisation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(3), pages 230-243, March.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:3:d:10.1057_palgrave.jors.2600690
    DOI: 10.1057/palgrave.jors.2600690
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600690
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600690?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. Levorato, Mario & Figueiredo, Rosa & Frota, Yuri, 2022. "Exact solutions for the two-machine robust flow shop with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 300(1), pages 46-57.
    2. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
    3. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2021. "Risk of delay evaluation in real-time train scheduling with uncertain dwell times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    4. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    5. Carlo Meloni & Marco Pranzo, 2020. "Expected shortfall for the makespan in activity networks under imperfect information," Flexible Services and Manufacturing Journal, Springer, vol. 32(3), pages 668-692, September.
    6. Theodor Freiheit & Wei Li, 2017. "The effect of work content imbalance and its interaction with scheduling method on sequential flow line performance," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2791-2805, May.

    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:pal:jorsoc:v:50:y:1999:i:3:d:10.1057_palgrave.jors.2600690. 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.palgrave-journals.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.