Scheduling two-machine flow shops with exact delays

Document Type

Conference Proceeding

Publication Date

4-1-2007

Abstract

We consider two-machine flow shop problems with exact delays. In this model, there are two machines, the upstream machine and the downstream machine. Each job j has two operations: the first operation has to be processed on the upstream machine and the second operation has to be processed on the downstream machine, subject to the constraint that the time interval between the completion time of the first operation and the start time of the second operation is exactly l̄j. We concentrate on the objectives of makespan and total completion time. For the makespan objective, we first show that the problem is strongly NP-hard even if there are only two possible delay values. We then show that some special cases of the problem are solvable in polynomial time. Finally, we design efficient approximation algorithms for the general case and some special cases. For the total completion time objective, we give optimal polynomial-time algorithm for a special case and an efficient approximation algorithm for another one. © World Scientific Publishing Company.

Identifier

34247241650 (Scopus)

Publication Title

International Journal of Foundations of Computer Science

External Full Text Location

https://doi.org/10.1142/S0129054107004711

ISSN

01290541

First Page

341

Last Page

359

Issue

2

Volume

18

This document is currently not available here.

Share

COinS