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

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. Copyright Springer-Verlag Berlin Heidelberg 2014

MoreLess

Year of publication:	2014
Authors:	Békési, József ; Galambos, Gábor ; Jung, Michael ; Oswald, Marcus ; Reinelt, Gerhard
Published in:	Mathematical Methods of Operations Research. - Springer. - Vol. 80.2014, 1, p. 47-81
Publisher:	Springer
Subject:	Coupled task problem \| Branch-and-bound \| Integer programming

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010999978