Mathematical Methods of Operations Research

, Volume 59, Issue 2, pp 193–203 | Cite as

An exact algorithm for scheduling identical coupled tasks

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

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 ai and bi of the two subtasks and the delay time Li. Open image in new windowOpen image in new window-hardness proofs or polynomial algorithms were given for all cases except for the one where ai=a, bi=b and Li=L. In this paper we present an exact algorithm for this problem with time complexity O(nr2L) where Open image in new window holds. Therefore the algorithm is linear in the number of jobs for fixed L.

Keywords

Scheduling Coupled Tasks Dynamic Programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2004

Authors and Affiliations

  • Dino Ahr
    • 1
  • József Békési
    • 2
  • Gábor Galambos
    • 2
  • Marcus Oswald
    • 1
  • Gerhard Reinelt
    • 1
  1. 1.Institute of Computer ScienceUniversity of HeidelbergHeidelbergGermany
  2. 2.Department of InformaticsJuhász Gyula Teacher’s Training CollegeSzegedHungary

Personalised recommendations