IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/1413.html
   My bibliography  Save this paper

On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule

Author

Listed:
  • Sotskov, Y.N.
  • Wagelmans, A.P.M.
  • Werner, F.

Abstract

The main objective of this paper is to stimulate interest in stability analysis for scheduling problems. In spite of impressive theoretical results in sequencing and scheduling, up to now the implementation of scheduling algorithms with a rather deep mathematical background in production planning, scheduling and control, and in other real-life problems with sequencing aspects is limited. In classical scheduling theory, mainly deterministic systems are considered and the processing times of all operations are supposed to be given in advance. Such problems do not often arise in practice: Even if the processing times are known before applying a scheduling procedure, OR workers are forced to take into account the precision of equipment, which is used to calculate the processing times, round-off errors in the calculation of a schedule, errors within the practical realization of a schedule, machine breakdowns, additional jobs and so on. This paper is devoted to the calculation of the stability radius of an optimal or an approximate schedule. We survey some recent results in this field and derive new results in order to make this approach more suitable for practical use. Computational results on the calculation of the stability radius for randomly generated job shop scheduling problems are presented. The extreme values of the stability radius are considered in more detail. The new results are amply illustrated with examples.

Suggested Citation

  • Sotskov, Y.N. & Wagelmans, A.P.M. & Werner, F., 1997. "On the Calculation of the Stability Radius of an Optimal or an Approximate Schedule," Econometric Institute Research Papers EI 9718/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    • Handle: RePEc:ems:eureir:1413
    as

    Download full text from publisher

    File URL: https://repub.eur.nl/pub/1413/eeb19960111120064.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sotskov, Y. & Sotskova, N. Y. & Werner, F., 1997. "Stability of an optimal schedule in a job shop," Omega, Elsevier, vol. 25(4), pages 397-414, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Nilotpal Chakravarti & Albert P.M. Wagelmans, 1997. "Calculation of Stability Radii for Combinatorial Optimization Problems," Tinbergen Institute Discussion Papers 97-106/4, Tinbergen Institute.
    2. Chakravarti, N. & Wagelmans, A.P.M., 1997. "Calculation of Stability Radii for Combinatorial Optimization Problems," Econometric Institute Research Papers EI 9740/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    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. Lai, Tsung-Chyan & Sotskov, Yuri N. & Sotskova, Nadezhda & Werner, Frank, 2004. "Mean flow time minimization with given bounds of processing times," European Journal of Operational Research, Elsevier, vol. 159(3), pages 558-573, December.
    2. repec:dgr:rugsom:00a22 is not listed on IDEAS
    3. 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).
    4. Constantin Waubert de Puiseau & Richard Meyes & Tobias Meisen, 2022. "On reliability of reinforcement learning based production scheduling systems: a comparative survey," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 911-927, April.
    5. Ramaswamy, R. & Chakravarti, N. & Ghosh, D., 2000. "Complexity of determining exact tolerances for min-max combinatorial optimization problems," Research Report 00A22, University of Groningen, Research Institute SOM (Systems, Organisations and Management).

    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:ems:eureir:1413. 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: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.html .

    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.