Job-shop production scheduling with reverse flows

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).

MoreLess

Year of publication:	2015
Authors:	Abdeljaouad, Mohamed Amine ; Bahroun, Zied ; Omrane, Anissa ; Fondrevelle, Julien
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 244.2015, 1, p. 117-128
Publisher:	Elsevier
Subject:	Scheduling \| Job-shop \| Reverse flows \| Heuristics \| Linear programming

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011209333