Scheduling is the allocation of shared resources over time to competing activities. It is convenient to adopt manufacturing terminology, where jobs represent activities and machines represent resources.
In general, the job shop scheduling problem (JSSP), a finite set of jobs is processed on a finite set of machines. Each job is characterized by a fixed order of operations, each of which is to be processed on a specific machine for a specified duration. It is a class of combinational optimization problems known as NP-Hard† one
References:
http://en.wikipedia.org/wiki/Combinatorial_optimization
†NP-hard - Wikipedia, the free encyclopedia, last modified 01:43, 18 February 2006, http://en.wikipedia.org/wiki/NP hard
Related Posts:
- Description of Job Shop Scheduling
- Assumptions in static JSSP
- Johnson’s Rule
- Algorithm of Johnson’s Rule
- Illustration for Johnson’s rule
- Modified Johnson’s Rule for n x m JSSP
- Limitations of Johnson’s Rule
- What makes scheduling problems hard?
© 2006 Kumaravel & Project Team
No comments :
Post a Comment
Blog authors can delete the comment if it contains the inappropriate contents.