Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

Abstract

article Free Access Share on Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan Authors: J. Bruno Department of Computer Science, University of California, Santa Barbara, California Department of Computer Science, University of California, Santa Barbara, CaliforniaView Profile , P. Downey Department of Computer Science, University of Arizona, Tucson, Arizona Department of Computer Science, University of Arizona, Tucson, ArizonaView Profile , G. N. Frederickson Department of Computer Science, The Pennsylvania State University, University Park, Pennsylvania Department of Computer Science, The Pennsylvania State University, University Park, PennsylvaniaView Profile Authors Info & Claims Journal of the ACMVolume 28Issue 1Jan. 1981 pp 100–113https://doi.org/10.1145/322234.322242Published:01 January 1981Publication History 98citation704DownloadsMetricsTotal Citations98Total Downloads704Last 12 Months29Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF