IDEAS home Printed from https://ideas.repec.org/a/ids/ijscom/v2y2016i2p189-203.html
   My bibliography  Save this article

Flexible flow shop scheduling for continuous production

Author

Listed:
  • Boris Sokolov
  • Dmitry Ivanov
  • Semyon A. Potryasaev

Abstract

Flexible flow shop problem is represented as the dynamic interpretation of scheduling based on a natural dynamic decomposition of the problem and its solution with the help of a modified form of continuous maximum principle blended with combinatorial optimisation. A theoretical analysis of optimal scheduling approach with uniform alternative machines is considered. The scheduling approach is based on a dynamic non-stationary interpretation of the job execution and a temporal decomposition of the scheduling problem. The optimality conditions as well as the structural properties of the model and the algorithm are investigated. Advantages and limitations of the proposed approach are discussed. The results of this study can be used as an extension to the existing mathematical programming models subject to the following issues: dynamics and non-stationarity of the operation execution, non-stationarity of the machine structures and capacity parameters, and representation of continuous flows. In addition, the formulation of the scheduling model in terms of control makes it possible to attract additional tools from mathematics of functional spaces such as stability, robustness, controllability, adaptability, etc. to the schedule analysis and real-time adjustment.

Suggested Citation

  • Boris Sokolov & Dmitry Ivanov & Semyon A. Potryasaev, 2016. "Flexible flow shop scheduling for continuous production," International Journal of Service and Computing Oriented Manufacturing, Inderscience Enterprises Ltd, vol. 2(2), pages 189-203.
    • Handle: RePEc:ids:ijscom:v:2:y:2016:i:2:p:189-203
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=76439
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Gheisariha, Elmira & Tavana, Madjid & Jolai, Fariborz & Rabiee, Meysam, 2021. "A simulation–optimization model for solving flexible flow shop scheduling problems with rework and transportation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 180(C), pages 152-178.

    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:ids:ijscom:v:2:y:2016:i:2:p:189-203. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=376 .

    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.