Cart (Loading....) | Create Account
Close category search window
 

Scheduling Coupled-Tasks on a Single Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Haibing Li ; Lehman Bros. Inc., New York, NY ; Hairong Zhao

In this paper, we consider the coupled-task scheduling problem, to schedule n jobs on a single machine. Each job consists of two coupled tasks which have to be processed in a predetermined order and at exactly a specified interval apart. The objective is to minimize the makespan. The problem was shown to be NP-hard in the strong sense even for some special cases. We analyze some heuristics with worst-case bounds for some NP-hard cases. In addition, we present a tabu search meta-heuristic for solving the general case. Computational results show that the meta-heuristic is efficient to solve the problem in terms of solution quality and running time

Published in:

Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on

Date of Conference:

1-5 April 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.