Loading time scheduling problem

Randeep Bhatia*, Samir Khuller, Joseph Naor

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

6 Scopus citations


In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a specified subset of the machines. Each machine has a loading time that is incurred only for the first task that is scheduled on the machine in a particular run. This basic scheduling problem arises in the context of machining on numerically controlled machines, query optimization in databases, and in other artificial intelligence applications. We give the first non-trivial approximation algorithm for this problem. We also prove non-trivial lower bounds on best possible approximation ratios for these problems. These improve on the non-approximability results that are implied by the non-approximability results for the shortest common supersequence problem. We use the same algorithmic technique to obtain approximation algorithms for a problem arising in the context of code generation for parallel machines, and for the weighted shortest common supersequence problem.

Original languageEnglish (US)
Pages (from-to)72-81
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - Dec 1 1995
EventProceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science - Milwaukee, WI, USA
Duration: Oct 23 1995Oct 25 1995

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Loading time scheduling problem'. Together they form a unique fingerprint.

Cite this