IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i4p620-633.html
   My bibliography  Save this article

A multistage graph-based procedure for solving a just-in-time flexible job-shop scheduling problem with machine and time-dependent processing costs

Author

Listed:
  • Albert Corominas
  • Alberto García-Villoria
  • Néstor-Andrés González
  • Rafael Pastor

Abstract

This paper deals with a new flexible job-shop scheduling problem in which the objective function to be minimised is the sum of the earliness and tardiness costs of the jobs and the costs of the operations required to perform the jobs, the latter depending on the machine and the time interval in which they are performed (as happens in many countries with the costs of electric power or those of manpower). We formalise the problem with a mathematical model and we propose a heuristic procedure that is based primarily on constructing a multistage graph and finding in it the shortest path from the source to the sink. We also describe the generation of the data-set used in an extensive computational experiment and expose and analyse the obtained results.

Suggested Citation

  • Albert Corominas & Alberto García-Villoria & Néstor-Andrés González & Rafael Pastor, 2019. "A multistage graph-based procedure for solving a just-in-time flexible job-shop scheduling problem with machine and time-dependent processing costs," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(4), pages 620-633, April.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:4:p:620-633
    DOI: 10.1080/01605682.2018.1452537
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1452537
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1452537?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:70:y:2019:i:4:p:620-633. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.