Coupled Task Scheduling with Time-Dependent Processing Times

16 Pages Posted: 14 Jan 2019 Last revised: 9 Jun 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: January 10, 2019

Abstract

The single machine coupled task scheduling problem includes a set of jobs, each with two separated tasks and there is an exact delay between the tasks. We investigate the single machine coupled task scheduling problem with the objective of minimizing the makespan under identical processing time for the first task and identical delay period for all jobs, and the time-dependent processing time setting for the second task. We provide optimal solution under certain conditions. In addition, we propose a dynamic program under the condition that the majority of jobs share the same time-dependent characteristic. We develop a heuristic for the general case, and show that the heuristic performs very well.

Keywords: single machine coupled task scheduling, time-dependent processing time, simple linear processing time, dynamic program, heuristic

Suggested Citation

Khatami, Mostafa and Salehipour, Amir and Salehipour, Amir, Coupled Task Scheduling with Time-Dependent Processing Times (January 10, 2019). Available at SSRN: https://ssrn.com/abstract=3313807 or http://dx.doi.org/10.2139/ssrn.3313807

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, Australia ( email )

Ultimo
Ultimo, NSW 2007
Australia

University of Technology Sydney (UTS) ( email )

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

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

Paper statistics

Downloads
35
Abstract Views
395
PlumX Metrics