FLOW SHOP SCHEDULING WITH DETERIORATING PROCESSING TIME AND CHAINS CONSTRAINT

The two-machine flow shop scheduling problem is considered with linear processing time and chains constraint in order to minimize the makespan. Under the simple linear deteriorating, nonnegative start and stop lag deteriorating rates are introduced so as to combine jobs and construct composite jobs satisfying precedence relations. Finally, the optimal polynomial algorithm for the two-machine flow shop scheduling problem with chains constraint is given.