Now showing items 1-9 of 9

    • A decomposition approach for the project scheduling problem 

      Pinto Langoni, Carlos Ricardo (Texas A&M University. Libraries, 1987)
      The problem addressed in this research is the project scheduling problem. Two types of solution methodologies commonly discussed in the literature are optimization procedures and heuristic ranking procedures. Optimization ...
    • Dynamic job scheduling in a distributed computer network with functionally similar nodes 

      Satterwhite, Charles Larry (Texas A&M University. Libraries, 1977)
      This research examines the operational problem of dynamic job scheduling in a distributed computer network with functionally similar nodes. A distributed computer network is considered to be an interconnection of computer ...
    • Hard real-time scheduling for the rate-group model 

      Kim, Myung Jun (Texas A&M University. Libraries, 1992)
      Many real-time systems built in the past based their scheduling on the cyclic executive model because it produces predictable schedules which facilitate exhaustive testing. The rate-monotonic algorithm has the advantage ...
    • Implementing a new statistical approach to project scheduling 

      Baker, Thomas Cecil (Texas A&M University. Libraries, 1978)
      This dissertation develops improvements to a new project scheduling procedure being developed at the Institute of Statistics, Texas A&M University. The project scheduling algorithm is a five step iterative procedure capable ...
    • A nonlinear multiprocessor scheduling problem 

      Price, Camille Cook
      The problem addressed in this research is that of assigning modules of a computer program among processors in a distributed computer network having functionally similar nodes. The assignment is to be made in such a way as ...
    • Processor scheduling with improved heuristic algorithms 

      Langston, Michael Allen (Texas A&M University. Libraries, 1981)
      Consideration is given to the problem of nonpreemptively scheduling a set of N independent tasks to a system of M identical processors, with the objective to minimize the overall finish time. Since this problem is known ...
    • Simultaneous lot sizing and scheduling : a heuristic algorithm for dynamic, discrete demands on a single facility 

      Park, Myungsub (Texas A&M University. Libraries, 1987)
      One of major decisions which firms must face is to determine when and how much to produce in what sequence. The existing practice is to go through stages of lot sizing, capacity planning and scheduling sequentially to ...
    • A software project scheduling assistant design and analysis 

      Fisher, Fred Hulen (Texas A&M University. Libraries, 1988)
      Conventional software development scheduling systems, while doing an adequate job in resource scheduling, have lacked the ability to accurately estimate required implementation effort. Typically the analyst is required to ...
    • Some problems in sequencing and scheduling utilizing branch and bound algorithms 

      Gim, Bongjin (Texas A&M University. Libraries, 1988)
      This dissertation deals with branch and bound algorithms which are applied to the two-machine flow-shop problem with sparse precedence constraints and the optimal sequencing and scheduling of multiple feedstocks in a batch ...