Cover Image
QR Code

Computing the expected cost of an appointment schedule for statistically identical customers with probabilistic service times.

A cogent method is presented for computing the expected cost of an appointment schedule where customers are statistically identical, the service time distribution has known mean and variance, and customer no-shows occur with time-dependent probability. The approach is computationally efficient and c...

Full description

Published in:Scientific World Journal pp. 949726 - 949727
Main Author: Dietz, Dennis C
Format: Journal Article
Published: Wiley-Blackwell 2014
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=104038453&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 104038453
    longDbName: CINAHL Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    dissinfo:
    jinfo:
      jid:
        1537744X
        1BX5
      jtl: Scientific World Journal
      issn: 1537744X
      maglogo: N
    pubinfo:
      dt: 2014
      pid: 480
      pub: Wiley-Blackwell
      place: Malden, Massachusetts
    artinfo:
      ui:
        104038453
        NLM24605070
        2012500380
        10.1155/2014/949726
        NLM24605070
        PMC3926282
        104038453
      ppf: 949726
      ppct: 1
      formats:
      tig:
        atl: Computing the expected cost of an appointment schedule for statistically identical customers with probabilistic service times.
      aug:
        au: Dietz, Dennis C
        affil: CenturyLink, Inc., Boulder, CO 80301, USA.
      sug:
        subj:
          Appointments and Schedules
          Models, Theoretical
          Algorithms
      ab: A cogent method is presented for computing the expected cost of an appointment schedule where customers are statistically identical, the service time distribution has known mean and variance, and customer no-shows occur with time-dependent probability. The approach is computationally efficient and can be easily implemented to evaluate candidate schedules within a schedule optimization algorithm.
      pubtype: Academic Journal
      doctype: Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N