Mathematical Methods of Operations Research

, Volume 80, Issue 1, pp 47–81

A branch-and-bound algorithm for the coupled task problem

  • József Békési
  • Gábor Galambos
  • Michael N. Jung
  • Marcus Oswald
  • Gerhard Reinelt
Original Article

DOI: 10.1007/s00186-014-0469-6

Cite this article as:
Békési, J., Galambos, G., Jung, M.N. et al. Math Meth Oper Res (2014) 80: 47. doi:10.1007/s00186-014-0469-6

Abstract

The coupled task problem is to schedule jobs on a single machine where each job consists of two subtasks and where the second subtask has to be started after a given time interval with respect to the first one. The problem has several applications and is NP-hard. In this paper we present a branch-and-bound algorithm for this problem and compare its performance with four integer programming models.

Keywords

Coupled task problem Branch-and-bound Integer programming 

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • József Békési
    • 1
  • Gábor Galambos
    • 1
  • Michael N. Jung
    • 2
  • Marcus Oswald
    • 2
  • Gerhard Reinelt
    • 2
  1. 1.Department of Computer Sciences, Juhász Gyula Teacher Training FacultyUniversity of SzegedSzeged Hungary
  2. 2.Fakultät für Mathematik und Informatik, Institut für InformatikUniversität HeidelbergHeidelbergGermany

Personalised recommendations