1/8/2024

CHAPTER 1:
INTRODUCTION TO PLANNING AND
SCHEDULING

Assoc. Prof. Dr. DO NGOC HIEN

Department of Industrial Systems Engineering (ISE )
Faculty of Mechanical Engineering (FME)
HoChiMinh City University of Technology (HCMUT)
Phone:
Email: [email protected]
10

Scheduling

• Scheduling: The allocation of resources over time to accomplish

specific tasks.

• Demand scheduling: A type of scheduling whereby customers are

assigned to a definite time for order fulfillment.

• Workforce scheduling: A type of scheduling that determines when

employees work.

• Operations scheduling: A type of scheduling in which jobs are

assigned to workstations or employees are assigned to jobs for
specified time periods.

1
 1/8/2024

Introduction

Operations scheduling is critical to the success of an

organization; however, it can be a very complicated task.
Effective schedules are needed to meet promised customer
delivery dates or inventory targets.

It covers the following areas in particular:

- assign job to a particular work center/ machine
- time of assignment of job and completion
- allocation of resources like manpower and materials
- time sequence of operations
- feedback and control function to take care of deviations

Work Centre

• A work center is an area in a business in which

productive resources are organized and work is
completed

Can be a single machine, a group of machines,

or an area where a particular type of work is
done

2
 1/8/2024

Performance Measures
From the manager’s perspective, identifying the performance
measures to be used in selecting a schedule is important. If the
overall goals of the organization are to be achieved, the
schedules should reflect managerially acceptable
performance measures. The following list describes the most
common performance measures used in operations scheduling.

Job Flow Time: The amount of shop time for the job is called
job flow time. It is the sum of the moving time between
operations, waiting time for machines or work orders, process
time (including setups), and delays resulting from machine
breakdowns, component unavailability, and the like.

Performance Measures
Makespan: The total amount of time required to complete a
group of jobs is called makespan.

Past Due: The measure past due can be expressed as the amount
of time by which a job missed its due date (also referred to as
tardiness) or as the percentage of total jobs processed over
some period of time that missed their due dates.

Work-in-Process Inventory: Any job in a waiting line, moving

from one operation to the next, being delayed for some reason,
being processed, or residing in component or subassembly
inventories is considered to be work-in-process inventory.

3
 1/8/2024

Performance Measures
Total Inventory: The sum of scheduled receipts and on-hand
inventories is the total inventory.

Utilization: The percent of work time productively spent by a

machine or worker is called utilization.

These performance measures often are interrelated.

An understanding of the interactions of job flow time,

makespan, past due, WIP inventory, total inventory, and
utilization can make scheduling easier.

Manufacturing Process

4
 1/8/2024

Objectives of Operations
Scheduling
• Making efficient use of the labour.

• Making best possible use of the equipments that are

available for the use.

• Increasing the profit.

• Increasing the output.

• Improving the service level.

Objectives of Operations
Scheduling
• Maximizing the delivery performance i.e. meeting the
delivery dates.

• Minimizing the inventory.

• Reducing the manufacturing time.

• Minimizing the production costs.

• Minimizing the worker costs.

5
 1/8/2024

Functions of Operations Scheduling

• Allocation of the resources.

• Shop floor control.

• Making maximum use of the plant at minimum possible

cost.

• Ensure that the needs of the manpower are optimum.

• Determination of the sequence of the jobs.

Functions of Operations Scheduling

• Specifying the start and the end time for each job (actively
scheduled).

• Getting quick feedback from the shops regarding the

delays and the various interruptions.

• Possess up – to – date information for the availability of

the materials, expected delivery dates etc.

• Possess up – to – date data on the machine regarding its

breakdown, servicing etc.

6
 1/8/2024

Types of Scheduling

Types of Operations Scheduling are as follows:

1. Forward operations scheduling –

• Classified on the basis of the time.
• All the activities are scheduled from the date of the planned order
release.
• First task of the job is scheduled.
• Its subsequent task is scheduled on the scheduled completion of the
first task.
• Like this, accordingly all the tasks of the job are scheduled.

Types of Scheduling

2. Backward operations scheduling–

• Also classified on the basis of the time.

• Activities are scheduled from the date or the planned receipt date.

• The last activity is scheduled first.

• Time of the start of the last task is considered as the time for the start
of the previous activity.

7
 1/8/2024

Shop Floor Control (SFC)

Schedule and monitor day-to-day job shop production
• Also called production control and production activity
control (PAC)
• Performed by production control department

• Loading - check availability of material, machines, and labor

• Sequencing - release work orders to shop and issue dispatch
lists for individual machines

• Monitoring - maintain progress reports on each job until it

is complete

Loading

Process of assigning work to limited resources

• Perform work with most efficient resources

• Use assignment method of linear programming to determine
allocation

8
 1/8/2024

Sequencing
• Prioritize jobs assigned to a resource
• If no order specified use first-come first-served (FCFS)
Other Sequencing Rules
• FCFS - first-come, first-served
• LCFS - last come, first served
• DDATE - earliest due date
• CUSTPR - highest customer priority
• SETUP - similar required setups
• SLACK - smallest slack
• CR - smallest critical ratio
• SPT - shortest processing time
• LPT - longest processing time

SCHEDULING PROBLEM

27

9
 1/8/2024

SCHEDULING PROBLEM

28

EXAMPLES OF SCHEDULING PROBLEMS

EXAMPLE 1 PAPER BAG FACTORY

29

10
 1/8/2024

EXAMPLES OF SCHEDULING PROBLEMS

EXAMPLE 1 PAPER BAG FACTORY
 different types of paper bags
 3 production stages
O printingof the logo
O gluing of the side
O sewing of one or both ends

 several machines for each stage

O differences in speed and function
O processing speed and processing quantity
O setup time for a change of the bag type

 due time and late penalty

minimization of late penalties, setup times 30

EXAMPLES OF SCHEDULING PROBLEMS

GATE ASSIGNMENTS AT AIRPORT

31

11
 1/8/2024

EXAMPLES OF SCHEDULING PROBLEMS

GATE ASSIGNMENTS AT AIRPORT
 different types of planes (size)
 different types of gates (size, location)
 flight schedule
 randomness (weather, take off policy)

 service time at gate

deplaning of passengers
service of airplane
boarding of passengers

minimization of work for airline personnel

32
minimization of airplane delay

EXAMPLE OF ROUTING AND SCHEDULING OF AIRPLANES

33

12
 1/8/2024

EXAMPLES OF SCHEDULING PROBLEMS

34

35

13
 1/8/2024

AIC! 10 MINUTES

WORK CENTER WORK

1 (DRILL CENTER 2
JOB PRESS) (LATHE)
A 5 2
B 3 6
C 8 4
D 10 7
E 7 12

Minimize the completion time!

AIC! 10 minutes
WORK CENTER 1 WORK CENTER
JOB (DRILL PRESS) 2 (LATHE)
A 5 2
B 3 6
C 8 4 B E D C A
D 10 7
E 7 12

Time 0 3 10 20 28 33

WC
1 B E D C A
Idle
WC
2 B E D C A
Job
Time 0 1 3 5 7 9 10 11 12 13 17 19 21 22 2325 27 29 31 33 35 completed

B E D C A

14
 1/8/2024

JOB PROPERTIES

38

MACHINE ENVIRONMENT

39

15
 1/8/2024

MACHINE ENVIRONMENT

40

CLASSIFICATION OF SCHEDULING MODELS

41

16
 1/8/2024

CLASSIFICATION OF SCHEDULING MODELS

42

43

17
 1/8/2024

SINGLE MACHINE MODEL

cv
cv
1 cv
1 cv
1
n

4 3 2 1

44

CLASSIFICATION OF SCHEDULING MODELS

45

18
 1/8/2024

MANUFACTURING PROCESS

46

47

19
 1/8/2024

RESTRICTIONS AND CONSTRAINTS

48

RESTRICTIONS AND CONSTRAINTS

49

20
 1/8/2024

OBJECTIVE FUNCTIONS

50

OBJECTIVE FUNCTIONS

51

21
 1/8/2024

OBJECTIVE FUNCTIONS

52

CLASSIFICATION OF SCHEDULING MODELS

53

22
 1/8/2024

CLASSIFICATION OF SCHEDULING MODELS

54

CLASSIFICATION OF SCHEDULING MODELS

55

23
 1/8/2024

CLASSIFICATION OF SCHEDULING MODELS

56

CLASSIFICATION OF SCHEDULING MODELS

57

24
 1/8/2024

CLASSIFICATION OF SCHEDULING MODELS

58

CLASSIFICATION OF SCHEDULING MODELS

59

25
 1/8/2024

EXAMPLE OF SCHEDULING PROBLEMS

60

AIC – 5 MINUTES

61

26
 1/8/2024

AIC – 5 MINUTES

62

COMPLEXITY HIERARCHY

63

27
 1/8/2024

CLASSES OF SCHEDULES
NONDELAY (GREEDY) SCHEDULE

64

PRECEDENCE CONSTRAINTS
ORIGINAL SCHEDULE

65

28
 1/8/2024

PRECEDENCE CONSTRAINTS
REDUCED PROCESSING TIME

66

PRECEDENCE CONSTRAINTS
USE OF 3 MACHINES

67

29
 1/8/2024

CLASSES OF SCHEDULES
ACTIVE SCHEDULE
It is not possible to construct another schedule by changing
the order of processing on the machines and having at
least one task finishing earlier without any task finishing
later.

There is at least one optimal and active schedule for Jm||γ if

the objective function is regular.

Example :
Consider a job shop with three machines and two jobs.
 Job 1 needs 1 time unit on machine 1 and 3 time units on machine 2.

 Job 2 needs 2 time units on machine 3 and 3 time units on machine

2.
 Both jobs have to be processed last on machine 2 68

CLASSES OF SCHEDULES
ACTIVE SCHEDULE

It is clear that this schedule is active as reversing the sequence of

the two jobs on machine 2 postpones the processing of job 2.
However, the schedule is neither nondelay nor optimal. Machine 2
remains idle until time 2 while there is a job available for processing
at time 1.
69

30
 1/8/2024

CLASSES OF SCHEDULES
SEMI - ACTIVE SCHEDULE
No task can be completed earlier without changing the order of
processing on any one of the machines.

Example:

Consider again a schedule with three machines and two jobs.

The routing of the two jobs is the same as in the previous
example.

 The processing times of job 1 on machines 1 and 2 are both

equal to 1.

 The processing times of job 2 on machines 2 and 3 are both

equal to 2.
70

CLASSES OF SCHEDULES
SEMI - ACTIVE SCHEDULE

Consider the schedule under which job 2 is processed on machine 2

before job 1.
This implies that job 2 starts its processing on machine 2 at time 2
and job 1 starts its processing on machine 2 at time 4.
>> This schedule is semi-active.
However, it is not active as job 1 can be processed on machine 2 71
without delaying the processing of job 2 on machine 2.

31
 1/8/2024

CLASSES OF SCHEDULES

72

VENN DIAGRAM OF CLASSES OF SCHEDULES

FOR JOB SHOPS

A Venn diagramm of the three classes of

nonpreemptive schedules; the nondelay schedules, the 73

active schedules, and the semi-active schedules

32
 1/8/2024

MANUFACTURING PROCESS

74

VIETNAM AIRLINE SCHEDULING PROBLEM

75

33
 1/8/2024

WAREHOUSE OPERATIONS AND SCHEDULING

76

SCHEDULING

77

34
 1/8/2024

78

35