Open Access. Powered by Scholars. Published by Universities.®
- Publication
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Task Scheduling In Networks, Cynthia Phillips, Clifford Stein, Joel Wein
Task Scheduling In Networks, Cynthia Phillips, Clifford Stein, Joel Wein
Dartmouth Scholarship
Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous. In this paper we remove this assumption and study the problem of network scheduling, where each job originates at some node of a network, and in order to be processed at another node must take the time to travel through the network to that node.
Our main contribution is to give approximation algorithms …
On Cvt Minimization In Single Machine Scheduling., D. K. Manna Dr.
On Cvt Minimization In Single Machine Scheduling., D. K. Manna Dr.
Doctoral Theses
Scheduling problens are quite common in real life. They arise whenever there is a need to plan execution of various tasks over time and therefore they play very important roles in commercial set-ups concerning manufacturing or service in the optimal use of resources and/or customers satisfaction. The theory of scheduling deals with the construction of suitable models and their analyses. Researchersattention was drawn to the study of scheduling problems using mathematical modeling, probably for the first time when Johnson (1954] published his famous work on flowshop problem. Since then, the study of scheduling problem and its context has gradually attracted …