Production _Planning and Scheduling

Abstract

The production planning process encounter many decisions on of the most detailed decisions is scheduling. Scheduling problems are classified according to the type of production, one of the most complicated scheduling problems is job shop problem. Many researchers devoted their work to this type of problems, but till now there is no efficient algorithm can solve the problem optimally, except the active schedule generation algorithm. On the other hand, very few algorithms are capable of dealing with real life scheduling problems.

In this work a number of modified algorithms are developed to improve the computational time of the active schedules. Two other algorithms are presented to solve job shop problems with ready times and with assembly structured jobs.

The results show that the computational time of the active schedules generation is improved, and the two algorithms developed for real life problems are applicable and proved to yield optimal solutions.

Key Words: Production Planning, Scheduling, Job Shop, Active Schedules, and Real Life Problems.