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 |
[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)
- The SPT schedule is optimal if the objective is to minimize the average flowtime.
- Earliest Due Date (EDD)
- The EDD schedule is optimal if the objective is to minimize the maximum lateness.
el dib
