Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Non-Preemptive Scheduling to Maximize the Minimum Intercompletion Time

Carlos C. Amaro1, Sanjoy K. Baruah 1, Thomas J. Marlowe2, Alexander D. Stoyen3
1De- partment of Computer & Information Science, New Jersey Institute of Technology, Uni- versity Heights, Newark, NJ 07102 USA
2Department of Math- ematics and Computer Science, Seton Hall University, South Orange, NJ 07079
3Department of Computer Science, The University of Vermont, Burlington, VT 05405
  • Published: 31/08/2000

Abstract

Temporal load-balancing – “spreading out” the executions of tasks over time — is desirable in many applications. A form of temporal load-balancing is introduced: scheduling to maximize minimum inter-completion time (MICT-scheduling). It is shown that MICT-scheduling is, in general, NP-hard. A number of restricted classes of task systems are identified, which can be efficiently MICT-scheduled.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Carlos C. Amaro, Sanjoy K. Baruah , Thomas J. Marlowe, Alexander D. Stoyen. Non-Preemptive Scheduling to Maximize the Minimum Intercompletion Time[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 034. 33-50. DOI: .