Coupled-task scheduling on a single machine subject to a fixed-job-sequence

Authors:
F. J. Hwang;Bertrand M. T. Lin
Affiliations:
Institute of Information Management, Department of Information and Finance Management, National Chiao Tung University, Hsinchu 300, Taiwan;Institute of Information Management, Department of Information and Finance Management, National Chiao Tung University, Hsinchu 300, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 10
Cited 0

On the complexity of coupled-task scheduling

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
Batching and scheduling in a multi-machine flow shop

Journal of Scheduling
Note: A note on scheduling identical coupled tasks in logarithmic time

Discrete Applied Mathematics
Scheduling of coupled tasks with unit processing times

Journal of Scheduling
Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type

Information Processing Letters
Approximation algorithms for scheduling problems with exact delays

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximation algorithms for UET scheduling problems with exact delays

Operations Research Letters
Improved analysis of an algorithm for the coupled task problem with UET jobs

Operations Research Letters
Interleaving two-phased jobs on a single machine

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates single-machine coupled-task scheduling where each job has two tasks separated by an exact delay. The objective of this study is to schedule the tasks to minimize the makespan subject to a given job sequence. We introduce several intriguing properties of the fixed-job-sequence problem under study. While the complexity status of the studied problem remains open, an O(n^2) algorithm is proposed to construct a feasible schedule attaining the minimum makespan for a given permutation of 2n tasks abiding by the fixed-job-sequence constraint. We investigate several polynomially solvable cases of the fixed-job-sequence problem and present a complexity graph of the problem.