Job-shop production scheduling with reverse flows
Mohamed Amine Abdeljaouad,
Zied Bahroun,
Anissa Omrane and
Julien Fondrevelle
European Journal of Operational Research, 2015, vol. 244, issue 1, 117-128
Abstract:
In this paper, we conduct a study of the job-shop scheduling problem with reverse flows. This NP-hard problem is characterized by two flows of jobs that cover the same machines in opposite directions. The objective is to minimize the maximal completion time of the jobs (i.e., the makespan).
Keywords: Scheduling; Job-shop; Reverse flows; Heuristics; Linear programming (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221715000338
Full text for ScienceDirect subscribers only
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:eee:ejores:v:244:y:2015:i:1:p:117-128
DOI: 10.1016/j.ejor.2015.01.013
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu (repec@elsevier.com).