Dissertation > Excellent graduate degree dissertation topics show

LPT Algorithm for m Uniform Machine Covering Problems

Author: NiuZuo
Tutor: TanZhiZuo
School: Zhejiang University
Course: Operational Research and Cybernetics
Keywords: Similar machine scheduling
CLC: O223
Type: Master's thesis
Year: 2008
Downloads: 40
Quote: 0
Read: Download Dissertation

Abstract


This paper makes a study of some kind of special circumstances similar machine scheduling problem, the objective function is to maximize machine minimum completion time, this problem is often referred to as the machine cover problem. This article mainly research is all the machine only a machine processing speed and other machine speed different this special circumstances. The algorithm is LPT algorithm, this algorithm first will all work according to the processing time size from big to small array, and then the workpiece arrangement in the current load the smallest machine processing. The full text is divided into three chapters: the first chapter is the introduction part, mainly introduces related scheduling problems, approximate algorithm and competitive ratio analysis and basic concept. The second chapter mainly considered the machine speed are 1, 1, s and 1, s, s (s > 1) three machine scheduling problems, and gives the LPT algorithm parameters boundary and s take a certain range of the parameter tight world, and gives the above two questions of constant tightly bound. The third chapter mainly studies machine speed for 1, 1,... , 1, s m table similar machine cover problem that when m was 4, s take a range of LPT algorithm parameters tightly bound.

Related Dissertations

  1. Two Parallel Machines Scheduling with a Potential Machine Release Time,O223
  2. Design and Implementation of the project ranking system in Hangzhou Technician College game,O223
  3. Some Tardiness Problems with Machine Disruption,O223
  4. Research on Scheduling Semiconductor Manufacturing Using Genetic Algorithm,O223
  5. A Flow-shop S with Parameters Research of Complexity and Heuristic Lgorithms for the Parallel Machine and Cheduling Problems,O223
  6. Workpiece may refuse the online scheduling problem of the two models,O223
  7. The Single Machine Parallel-batching Scheduling Problem with Family-jobs,O223
  8. Workpiece parallel machine online scheduling problem with precedence constraints,O223
  9. Online Scheduling of Unit Length Jobs on a Batching Machine to Maximize the Number of Early Jobs,O223
  10. On-line Scheduling on Partial Batch-machine,O223
  11. And so long workpieces online scheduling batches under Order Restriction,O223
  12. Power-Aware Scheduling with Discrete Voltages,O223
  13. Two Kinds of Double Objective Functions Scheduling Problem Reserch,O223
  14. Parallel Machine Scheduling with Chains Precedence Constraints,O223
  15. On-line Parallel Machine Scheduling with Chains Precedence Constraints,O223
  16. Two Special Models of On-line Batch Scheduling,O223
  17. Semi-on-line Scheduling on Parallel Machines with Non-simultaneous Machine Available Times,O223
  18. Two Models on Batch Scheduling of Weighted Sum Objectives,O223
  19. Service level constraints parallel machine scheduling problem,O223
  20. Multi-agent Scheduling with Release Date,O223
  21. Machine-scheduling Problems with the Learning Effect and Deteriorated Jobs,O223

CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > An integrated approach
© 2012 www.DissertationTopic.Net  Mobile