IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v25y1997i4p397-414.html
   My bibliography  Save this article

Stability of an optimal schedule in a job shop

Author

Listed:
  • Sotskov, Y.
  • Sotskova, N. Y.
  • Werner, F.

Abstract

This paper is devoted to the calculation of the stability radius of an optimal schedule for a job shop problem, when the objective is to minimize mean or maximum flow times. The approach used may be regarded as an a posteriori analysis, in which an optimal schedule has already been constructed and the question is to determine such changes in the processing times of operations as do not destroy the optimality of the schedule at hand. More precisely, the stability radius denotes the largest quantity of independent variations of the processing times of the operations such that an optimal schedule of the problem remains optimal. Although in scheduling theory mainly deterministic problems are considered and the processing times are supposed to be given in advance, such scheduling problems do not often arise in practice. Even if the processing times are know before applying a scheduling procedure, OR workers are forced to take into account possible changes and errors within the practical realization of a schedule, e.g. additionally arriving jobs, machine breakdowns, the precision of equipment which is used to calculate the processing times, and so on. In other words, usually in practice a schedule has to be realized under conditions of uncertainty. This paper investigates the influence of errors and possible changes of the processing times on the optimality of a schedule. To this end, extensive numerical experiments with randomly generated job shop scheduling problems are performed and discussed. The developed software provides the possibility of comparing the values of the stability radii, the numbers of optimal schedules and some other "numbers" for two often used criteria. The main question we try to answer is how large the stability radius is, on average, for randomly generated job shop problems.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:jomega:v:25:y:1997:i:4:p:397-414
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(97)00012-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Christopher J. Piper & Andris A. Zoltners, 1976. "Some Easy Postoptimality Analysis for Zero-One Programming," Management Science, INFORMS, vol. 22(7), pages 759-765, March.
    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. 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. 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).
    3. repec:dgr:rugsom:00a22 is not listed on IDEAS
    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. 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.
    6. 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.

    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. George R. Wilson & Hemant K. Jain, 1988. "An approach to postoptimality and sensitivity analysis of zero‐one goal programs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 73-84, February.
    2. Tcha, Dong-wan & Myung, Young-soo & Chung, Ki-ho, 1995. "Parametric uncapacitated facility location," European Journal of Operational Research, Elsevier, vol. 86(3), pages 469-479, November.
    3. Babacar Thiongane & Anass Nagih & Gérard Plateau, 2005. "An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual," Annals of Operations Research, Springer, vol. 139(1), pages 353-373, October.
    4. Wang, Hsiao-Fan & Horng, Jyh-Shing, 1996. "Structural approach to parametric analysis of an IP on the case of the right-hand side," European Journal of Operational Research, Elsevier, vol. 92(1), pages 148-156, July.

    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:eee:jomega:v:25:y:1997:i:4:p:397-414. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.