0% found this document useful (0 votes)
107 views

ABSTRACT1

Scheduling rules are used to determine the order of jobs waiting to be processed on machines in a job shop. This work analyzes the performance of various scheduling rules under different conditions of due dates and job arrival times. Different scheduling rules based on processing time, due dates, and combinations are evaluated based on mean flow time, tardiness, and percentage of tardy jobs. A comparative analysis of the rules' relative performance is conducted through simulation and work sampling in the job shop.

Uploaded by

vscs.1982
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
107 views

ABSTRACT1

Scheduling rules are used to determine the order of jobs waiting to be processed on machines in a job shop. This work analyzes the performance of various scheduling rules under different conditions of due dates and job arrival times. Different scheduling rules based on processing time, due dates, and combinations are evaluated based on mean flow time, tardiness, and percentage of tardy jobs. A comparative analysis of the rules' relative performance is conducted through simulation and work sampling in the job shop.

Uploaded by

vscs.1982
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

ABSTRACT

Scheduling is an important aspect of the shop floor management system, which


can have a significant impact on the performance of the system. In a dynamic job shop,
jobs arrive at the shop with the inter-arrival times described by a specified probability
distribution.

Scheduling a job shop essentially involves deciding the order or priority for the
jobs waiting to be processed at each machine so as to satisfy the technological constraints
and to meet the desired objective. The decision as to which job is to be loaded on a
machine is normally made with the help of scheduling rules.

This work deals with an analysis of the performance of various scheduling rules
in a Job Shop Production System (JSPS). Different conditions arising out of due date
settings and inter arrival times of jobs are considered. Different sets of scheduling rules
such as processing time based rules, due date based rules, and some combination rules
have been considered for study. The performance measures evaluated are mean flow time,
mean tardiness and percentage of tardy jobs. A comparative analysis of the relative
performance of these rules has been carried out. A detailed investigation of the existing
performance is also carried out in the chosen job shop using work sampling technique.

You might also like