Scribd
Upload
5 views3 pages

CHAPTER 13 Outline

Chapter 13 discusses the scheduling and controlling of production activities to minimize unnecessary work. It covers concepts of single machine scheduling, performance measures, and various rules such as Shortest Processing Time (SPT) and Earliest Due Date (EDD) for job sequencing. Additionally, it introduces Hodgson's algorithm for minimizing tardy jobs and briefly touches on flow shop scheduling.

Uploaded by

Wanna X1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
5 views3 pages

CHAPTER 13 Outline

Chapter 13 discusses the scheduling and controlling of production activities to minimize unnecessary work. It covers concepts of single machine scheduling, performance measures, and various rules such as Shortest Processing Time (SPT) and Earliest Due Date (EDD) for job sequencing. Additionally, it introduces Hodgson's algorithm for minimizing tardy jobs and briefly touches on flow shop scheduling.

Uploaded by

Wanna X1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
You are on page 1/ 3

CHAPTER 13 - Scheduling and Controlling Production Activities

Topic Outcomes
● Discuss the concepts and rules and how to schedule and control the production activities
in order to minimize unnecessary work that nay affect operations.

1.1 Introduction
Scheduling - the portion of begins and wrap up time to each specific arrange.

1.2. Concepts of Single Machine Scheduling

1. A lot of independent, single-activity occupations is accessible for preparing at time zero.

2. Set-up season of each activity is free of its situation in employments grouping. Along
these lines, the set-up season of each activity can be remembered for its handling time.

3. Employment descriptors are known ahead of time.

4. One machine is constantly accessible and is never kept inactive when work is pausing.

5. Each activity is handled till its consummation without break.

Processing time -
Ready time -
Due date -
Completion time -
Fulfilment time
Flow time -
Delay -
Tardiness -

1.3 Measures of Performance

1.4 Shortest Processing Time (SPT) rule

SPT - sequencing the jobs in increasing order of processing time.


1.5 WSPT Rule

1.6 Earliest Due Date Rule (EDD)

Lj = Cj - dj

Lj = Lateness (positive or negative)


Lmax - maximum job lateness
Tmax - maximum job tardiness

1.7 Minimizing the Number of Tardy Jobs


Tardy job - completed beyond its due date.

Exact Algorithm for the general cases:

a. First, a set (E) of early jobs, in EDD order.


b. Then, a set (L) of late jobs, in any order.

HODGSON'S ALGORITHM TO MINIMIZE NT

Step 1: Arrange the jobs in EDD order and assume this, as set E. Let set L be empty.

Step 2: If no jobs in E are late, then stop. Find the union of E and L; otherwise, identify the first
late job in E. Let it be job K.

Step 3: Identify the longest job, among the first K jobs in the sequence. Remove this job from E
and place it in L. Revise the completion times of the jobs remaining in E and return, to Step 2.
1.8 Flow Shop Scheduling

You might also like