Single-machine scheduling with general costs under compound-type distributions

Xiaoqiang Cai*, Xianyi Wu, Xian Zhou

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


We investigate the problem of scheduling n jobs on a single machine with the following features. The cost functions are general stochastic processes, which can be used to model the effects of stochastic price fluctuations, stochastic due times, etc., and the stochastic processing times follow a class of distributions, which includes exponential, geometric, and other families of distributions. Such a class of distributions is characterized by its characteristic functions. The optimal policies for these scheduling problems, both without precedence constraints, or with precedence in the form of nonpreemptive chains, are discussed, respectively.

Original languageEnglish
Pages (from-to)77-84
Number of pages8
JournalJournal of Scheduling
Issue number1
Publication statusPublished - Feb 2007
Externally publishedYes


  • Characteristic functions
  • Convexity order
  • Due dates
  • Increment order
  • Single machine
  • Stochastic cost functions
  • Stochastic scheduling


Dive into the research topics of 'Single-machine scheduling with general costs under compound-type distributions'. Together they form a unique fingerprint.

Cite this