An exact algorithm for scheduling identical coupled tasks

Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald and Gerhard Reinelt

Mathematical Methods of Operations Research, 2004, vol. 59, issue 2, 193-203

Abstract: The coupled task problem is to schedule n jobs on one machine where each job consists of two subtasks with required delay time between them. The objective is to minimize the makespan. This problem was analyzed in depth by Orman and Potts [3]. They investigated the complexity of different cases depending on the lengths a i and b i of the two subtasks and the delay time L i . [InlineMediaObject not available: see fulltext.][InlineMediaObject not available: see fulltext.]-hardness proofs or polynomial algorithms were given for all cases except for the one where a i =a, b i =b and L i =L. In this paper we present an exact algorithm for this problem with time complexity O(nr 2L ) where [InlineMediaObject not available: see fulltext.] holds. Therefore the algorithm is linear in the number of jobs for fixed L. Copyright Springer-Verlag 2004

Keywords: Scheduling; Coupled Tasks; Dynamic Programming (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860300328 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:59:y:2004:i:2:p:193-203

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860300328

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().