×

zbMATH — the first resource for mathematics

On batch scheduling of jobs with stochastic service times and cost structures on a single server. (English) Zbl 0329.60072
MSC:
60K25 Queueing theory (aspects of probability theory)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., ()
[2] Bruno, J.; Coffman, E.G.; Sethi, R., Scheduling independent tasks to reduce Mean finishing time, Comm. ACM, 17, 382-387, (1974) · Zbl 0283.68039
[3] Bruno, J.; Coffman, E.G.; Sethi, R., Algorithms for minimizing Mean flow time, () · Zbl 0297.68048
[4] Bruno, J.; Hofri, M., On scheduling chains of jobs on one processor with limited preemptions, SIAM J. computing, 4, 478-490, (1975) · Zbl 0335.90028
[5] Conway, R.W.; Maxwell, W.L.; Miller, L.W., ()
[6] Horn, W.A., Single-machine job sequencing with treelike precedence ordering and linear delay penalties, SIAM J. appl. math., 23, 189-202, (1972) · Zbl 0224.90025
[7] Sidney, J.E., Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs, Operations res., 23, 283-298, (1975) · Zbl 0304.90058
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.