This paper is concerned with hybrid flow shop scheduling taking account of different additional constraints, especially transportation requests. Our objective is total weighted completion time minimization. We develop a fast (two phase) heuristic solution technique, which is based on simple dispatching rules. To evaluate our approach empirically, we introduce and analyze lower bounds based on the LP relaxation of time-indexed mixed-integer formulations.
展开▼