论文信息 - On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server

On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server

Jobs are modeled as decision trees of tasks in this paper. With each task is associateda joint probability distribution governing the deferral cost of the task, the execution time of the task, and a pointer to the descendant task next to be executed in the job. For a collection of jobs, an efficient algorithm is found and analyzed for sequencing jobs so as to minimize the total expected cost.

Edward G. Coffman | John L. Bruno | D. B. Johnson

[1] W. A. Horn. Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .

[2] William L. Maxwell,et al. Theory of scheduling , 1967 .

[3] Jeffrey B. Sidney,et al. Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[5] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[6] Edward G. Coffman,et al. Algorithms for Minimizing Mean Flow Time , 1974, IFIP Congress.

[7] Micha Hofri,et al. On Scheduling Chains of Jobs on One Processor with Limited Preemption , 1975, SIAM J. Comput..