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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (688 KB)

Source

Journal of the ACM (JACM) archive
Volume 28 , Issue 1 (January 1981) table of contents

Pages: 100 - 113

Year of Publication: 1981

ISSN:0004-5411

Authors

J. Bruno	Department of Computer Science, University of California, Santa Barbara, California
P. Downey	Department of Computer Science, University of Arizona, Tucson, Arizona
G. N. Frederickson	Department of Computer Science, The Pennsylvania State University, University Park, Pennsylvania

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 47, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322234.322242 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	COFFMAN, E.G. JR., ED. Computer and Job-Shop Scheduling Theory. John Wiley, New York, 1976.
	2	CONWAY, R.W., MAXWELL, W.L., Ah'D MILLER, L.W. Theory of Scheduling. Addison-Wesley, Reading, Mass., 1967.
	3	GRAHAM, R.L. Bounds on muhiprocessing timing anomalies. SlAM J. Appl. Math. 17, 2 (March 1969), 416--429.
	4	KARP, R.M. Reducibility among combinatorial problems. In The Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds., Plenum Publishing, New York, 1972.
	5	MCNAUGHTON, R. Scheduling with deadlines and loss functions. Manage. ScL 6 (1959), 1-12.
	6	ROTHKOPF, M.H. Scheduling with random service times. Manage. Sci. 12 (1966), 707-713.
	7	SMITH, W.E. Various optimizers for single-stage production. Naval Res. Log. Q. 3 (1956), 59-66.
	8	WEBER, R.R. Optimal organization of multi-server systems. Ph.D. Dissertation, Queen's College, Cambridge, April 1979.

CITED BY 7

	Tara Javidi , Nah-Oak Song , Demosthenis Teneketzis, EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES, Probability in the Engineering and Informational Sciences, v.15 n.4, p.409-443, October 2001
	Jean-Paul M. Arnaout , Ghaith Rabadi, Minimizing the total weighted completion time on unrelated parallel machines with stochastic times, Proceedings of the 37th conference on Winter simulation, December 04-07, 2005, Orlando, Florida
	Rolf H. Möhring , Andreas S. Schulz , Marc Uetz, Approximation in stochastic scheduling: the power of LP-based priority policies, Journal of the ACM (JACM), v.46 n.6, p.924-942, Nov. 1999
	Adam Rifkin, The utility of foresight in single server scheduling, Proceedings of the 30th annual Southeast regional conference, April 08-10, 1992, Raleigh, North Carolina
	Nicole Megow , Marc Uetz , Tjark Vredeveld, Models and Algorithms for Stochastic Online Scheduling, Mathematics of Operations Research, v.31 n.3, p.513-525, August 2006
	Mark Scharbrodt , Thomas Schickinger , Angelika Steger, A new average case analysis for completion time scheduling, Journal of the ACM (JACM), v.53 n.1, p.121-146, January 2006
	Christel Baier , Holger Hermanns , Joost-Pieter Katoen , Boudewijn R. Haverkort, Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes, Theoretical Computer Science, v.345 n.1, p.2-26, 21 November 2005