Master

Schedules,
Operational
Schedules
MEMBERS:
CINCO, RAFAEL
COLLADO, DANIEL

01
CRUZ, ANGEL BLUE
ONG, RAINE
OBJECTIVES IN SCHEDULING
There are many possible objectives in
constructing a schedule, including
02
• Meeting customer due dates;
Production control - The scheduling and monitoring of dayto-day production in a job shop.

• Minimizing job lateness;

Load leveling - The process of smoothing out the work assigned.
• Minimizing response time;
Dispatch list - A list of orders released to the shop that specifies the sequence in which jobs should be processed.
• Minimizing completion time;

• Minimizing time in the system;

• Minimizing overtime;

• Maximizing machine or labor utilization;

• Minimizing idle time; and

• Minimizing work‐in‐process inventory.

Regardless of their primary scheduling objective, manufacturers typically have a production
control department whose responsibilities consist of three activities:

• Loading—checking the availability of material, machines, and labor. Production control assigns work
to individual workers or machines, and then attempts to smooth out the load to make the MRP
schedule “doable.” Smoothing the load is called load leveling.
• Sequencing—releasing work orders to the shop and issuing dispatch lists for individual machines.
• Monitoring—maintaining progress reports on each job until it is completed.
LOADING
• Loading The process of assigning work to limited
resources. Many times an operation can be performed by
various persons, machines, or work centers but with
04
varying efficiencies. If there is enough capacity, each
worker should be assigned to the task that he or she
performs best, and each job to the machine that can
process it most efficiently.
THE ASSIGNMENT METHOD
• assignment method is a specialized linear programming solution
procedure for deciding which worker to assign to a task, or which job
to assign to a machine.

EXAMPLE:
06
Monitorin
g
Gantt Chart

Add a little bit of body text

Input and Output Chart
 ADVANCE PLANNING AND SCHEDULING
• Infinite scheduling
Loads without regard to capacity, then levels the load and sequences the jobs.

• Finite scheduling

Sequences jobs as part of the loading decision. Resources are never loaded beyond capacity.

• Finite scheduling

Sequences jobs as part of the loading decision. Resources are never loaded beyond capacity.
THEORY OF COSTRAINTS
• Theory of constraints (TOC) A finite scheduling approach that concentrates on scheduling the bottleneck resource.

Eliyahu Goldratt
- most systems are inherently unbalanced and that he
would try to balance the flow of work through the
system instead.
Drum-buff er-rope
- The drum sets the pace for the production, a buffer is placed before the bottleneck, and a rope communicates changes.

D rum - the bottleneck, beating to set the pace of production for the rest of the system.

Buffer - inventory placed in front of the bottleneck to ensure it is always kept busy.

Throughput - This is necessary because output from the bottleneck determines the output or throughput of the system

Rope - the communication signal that tells the processes upstream from the bottleneck when they should begin production (similar to a kanban).

Process vs. Transfer Batch Sizes

The TOC scheduling procedure, illustrated in Example 17.5, follows these steps:

• Identify the bottleneck.

• Schedule the job first whose lead time to the bottleneck is less than or equal to the bottleneck processing time.

• Forward schedule the bottleneck machine.

• Backward schedule the other machines to sustain the bottleneck schedule.

• Transfer in batch sizes smaller than the process batch size.

Identify the bottleneck:
Process in batches of 100, transfer one‐at‐a‐time:
Employee Scheduling
 Automated Scheduling Systems

Staff scheduling assigns qualified workers to standardized shift patterns, taking into account leave requests and scheduling conflicts. The solutions consider legal and social constraints such as labor laws for minors, overtime payment regulations, and legal or religious holidays that may differ by global location.

Schedule bidding puts certain shift positions or schedule assignments up for bid and allows workers to post and trade schedules with others as long as coverage and skill criteria are met.

Schedule optimization creates demand‐driven forecasts of labor requirements and assigns workers to variable schedules (in some cases, as small as 15 ‐minute blocks of time) that change dynamically with demand. The optimization is based on mathematical programming and artificial intelligence techniques.