The pegs-rule for probabilistic sequencing situations

H.J.M. Hamers, M. Slikker

Research output: Book/ReportReport

212 Downloads (Pure)

Abstract

This paper considers one-machine sequencing situations in which agents are in a ed initial order before the processing of the machine starts. The agents are allowed to rearrange positions to save costs w.r.t. the costs given by the initial order. We will assume that the agents are not certain about the position they will take in the initial order. For these sequencing situations we introduce and characterize in two dierent ways the Probabilistic Equal Gain Splitting (PEGS) rule that assigns the expected cost savings to the agents.
Original languageEnglish
PublisherUnknown Publisher
Number of pages9
VolumeFEW 703
Publication statusPublished - 1995

Publication series

NameResearch memorandum / Tilburg University, Faculty of Economics and Business Administration
VolumeFEW 703

Keywords

  • Scheduling
  • Costs
  • operations research

Fingerprint Dive into the research topics of 'The pegs-rule for probabilistic sequencing situations'. Together they form a unique fingerprint.

  • Cite this

    Hamers, H. J. M., & Slikker, M. (1995). The pegs-rule for probabilistic sequencing situations. (Research memorandum / Tilburg University, Faculty of Economics and Business Administration; Vol. FEW 703). Unknown Publisher.