Single machine scheduling

From Wikipedia, the free encyclopedia

Single machine scheduling or single resource scheduling is the process of assigning a group of tasks to a single machine or resource. The tasks are arranged so that one or many performance measures may be optimized.

Contents 1 Performance Measures 2 Solution Techniques 2.1 Heuristics 2.2 Computational

[edit] Performance Measures

The performance measures of the tasks in the single machine scheduling problem include:

• Tardiness
• Earliness
• Lateness
• Flowtime

[edit] Solution Techniques

Many solution techniques have been applied to solving single machine scheduling problems. Some of the are listed below.

[edit] Heuristics

• Shortest Processing Time (SPT)
• Earliest Due Date (EDD)

[edit] Computational

• Genetic Algorithms
• Neural Networks