An improved algorithm for the two machine flow shop problem with several availability constraints |
| |
| Authors: | Hatem Hadda |
| |
| Institution: | 1. Unité de Recherche URAII, INSAT-Tunis, Centre Urbain Nord B.P. N676, 1080, Tunis Cedex, Tunisia
|
| |
| Abstract: | In this paper we deal with the two-machine flow shop scheduling problem with several availability constraints on the first
machine, under the resumable scenario. We first develop an improved algorithm with a relative worst-case error bound of 4/3.
We then present a polynomially solvable case. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
