The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan

This paper addresses the problem of scheduling unit-time operations with integral and non-negative time delay considerations on a two-machine open-shop environment. The criterion to minimize is the makespan. Two well solvable cases and two approximation algorithms, with their worst-case analyses, are presented.

MoreLess

Year of publication:	2010
Authors:	Munier-Kordon, Alix ; Rebaine, Djamal
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 203.2010, 1, p. 42-49
Publisher:	Elsevier
Keywords:	Makespan Open-shop Time delays Well solvable case Worst-case analysis

More details

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

Persistent link: https://ebvufind01.dmz1.zbw.eu/10008483265