ABSTRACT
Job sequencing deals with the determination of the appropriate order in which waiting jobs should be served. Due to the combinatorial nature of sequencing problems, when the number of jobs is very large, the number of alternative job sequences also becomes very large. That is why numerous heuristic procedures have been developed for special case problems. There are also several priority sequencing rules (e.g., €rst in €rst out, last in €rst out, shortest processing time €rst, and longest processing time €rst) used in the assignment of jobs to one machine.
