A Binary Search Method for the General Coupled Task Scheduling Problem

13 Pages Posted: 19 Sep 2019

See all articles by Mostafa Khatami

Mostafa Khatami

University of Technology Sydney (UTS)

Amir Salehipour

University of Technology Sydney (UTS); University of Technology Sydney, Australia

Date Written: September 4, 2019

Abstract

The coupled task scheduling problem aims to schedule a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. We study the problem of scheduling a set of coupled jobs to be processed on a single machine with the objective of minimizing the makespan, which is known to be strongly NP-hard. We obtain competitive lower bounds for the problem through different procedures, including solving 0-1 knapsack problems. We obtain an upper bound by applying a heuristic algorithm. We then propose a binary search heuristic algorithm for the coupled task scheduling problem. We perform extensive computational experiments and show that the proposed method is able to obtain quality solutions. The results also indicate that the proposed solution method outperforms the standard exact solver Gurobi.

Keywords: coupled task scheduling, single machine, minimizing makespan, binary search, heuristic, bounds

Suggested Citation

Khatami, Mostafa and Salehipour, Amir and Salehipour, Amir, A Binary Search Method for the General Coupled Task Scheduling Problem (September 4, 2019). Available at SSRN: https://ssrn.com/abstract=3451871 or http://dx.doi.org/10.2139/ssrn.3451871

Mostafa Khatami

University of Technology Sydney (UTS) ( email )

15 Broadway, Ultimo
PO Box 123
Sydney, NSW 2007
Australia

Amir Salehipour (Contact Author)

University of Technology Sydney (UTS) ( email )

15 Broadway, Ultimo
PO Box 123
Sydney, NSW 2007
Australia

University of Technology Sydney, Australia ( email )

Ultimo
Ultimo, NSW 2007
Australia

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
35
Abstract Views
376
PlumX Metrics