Study the job shop scheduling by using modified heuristic rule

الملخص EN

The process of scheduling is considered as one of the more important production planning processes which faces the management of companies, because of the pressure of competition processes.

The management of companies and firms take automation of this process to get speed and precisions to take suitable decisions.

Various kinds of scheduling problems have received a lot of attention from researchers in a number of fields.

So far research has primarily been focused on finding a good solution with respect to makespan and total completion time.

Heuristic rules have strong advantages in that these are easy to understand, easy to apply and require relatively little computer time.

For that the researcher has designed a system aided by computer for operations scheduling on machines in job shop production system based on new heuristic rules to help scheduler in solving problem in this field.

This system is named "Computer Aided-Job Shop Scheduling" (CA-JSS).

It is construction based on two suggested rules those are called "Modified Least Work Remaining" and "Modified Most Work Remaining".

We wiII apply it particularly on group of cases.

We have been divided these cases into two stages.

In the first stage ten examples taken from scientific references are used as theoretical cases, in second stage we take practical case from State Company for Electrical Industry (SCEI).

The CA-JSS proved its efficiency and ability in scheduling the operations.

The results appear for this system in some cases best than (Win QSB) software.