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

Albert Corominas, Alberto García-Villoria, Néstor-Andrés González and Rafael Pastor

Journal of the Operational Research Society, 2019, vol. 70, issue 4, 620-633

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.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2018.1452537 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:70:y:2019:i:4:p:620-633

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2018.1452537

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().