Single Machine Scheduling to Maximize Maximum Cost - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Single Machine Scheduling to Maximize Maximum Cost

Abstract

Problems of schedluing $n$ jobs on a single machine to maximize maximum cost are studied. The jobs may have diffrent release dates and precedence constraints may be given on the set of jobs. Only semi-active schedules are of interest. These problems arise in predicetive-reactive scheduling. The most general problem can be solved in $o(n^3)$ times. Algorithmic and computational complexity results are derived for special cases.
Not file

Dates and versions

inria-00100507 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100507 , version 1

Cite

Mohamed Ali Aloulou, Mikhail Y. Kovalyov, Marie-Claude Portmann. Single Machine Scheduling to Maximize Maximum Cost. Fifth Workshop on Models and Algorithms for Planning and Scheduling Problems - MAPSP'2001, 2001, Aussois, France, 2 p. ⟨inria-00100507⟩
64 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More