Production Scheduling PDF

Unauthorized reproduction or distribution prohibitedฺ Copyright© 2017, Oracle and/or its affiliatesฺ
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija
Oracle Value Chain Planning:
Implement Production
Scheduling
Student Guide
D90049GC10
Edition 1.0 | March 2015 |
Learn more from Oracle University at oracle.com/education/

Copyright © 2015, Oracle and/or it affiliates. All rights reserved.
Disclaimer
This document contains proprietary information and is protected by copyright and other intellectual property laws. You may copy and
print this document solely for your own use in an Oracle training course. The document may not be modified or altered in any way.
Except where your use constitutes "fair use" under copyright law, you may not use, share, download, upload, copy, print, display,
perform, reproduce, publish, license, post, transmit, or distribute this document in whole or in part without the express authorization of
Oracle.
The information contained in this document is subject to change without notice. If you find any problems in the document, please report
them in writing to: Oracle University, 500 Oracle Parkway, Redwood Shores, California 94065 USA. This document is not warranted to
be error-free.
Restricted Rights Notice
If this documentation is delivered to the United States Government or anyone using the documentation on behalf of the United States
Government, the following notice is applicable:
U.S. GOVERNMENT RIGHTS

The U.S. Government’s rights to use, modify, reproduce, release, perform, display, or disclose these training materials are restricted by
bl e
the terms of the applicable Oracle license agreement and/or the applicable U.S. Government contract.
fe r a
Trademark Notice
t r a ns
Oracle and Java are registered trademarks of Oracle and/or its affiliates. Other names may be trademarks of-their respective owners.
n on
s a
) a
h deฺ
o
er t Gui
ฺ a
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija
Contents
I Implement VCP Production Scheduling I-2

VCP Production Scheduling I-3
Program Agenda I-4
1 Introduction
Introduction 1-2
Demand Driven Supply Chain 1-3
ble
Oracle Value Chain Planning 1-4
fe r a
Value Chain Planning Solution 1-6
ans
Oracle Production Scheduling 1-9
n - t r
a no
2 Production Scheduling Fundamentals Editors and BasicsNavigation
) h a eฺ
Production Scheduling Fundamentals 2-2
eRoutings, id
ro GuOperations
Production Scheduling Fundamentals Resources,
i c ฺ a n t 2-13
n
Production Scheduling Fundamentals o2-14
s de
a t u
n is S Calendars, Changeovers 2-46
Production Scheduling Fundamentals Attributes,
p a
@
Production Scheduling Fundamentals
p e th2-47
Production Scheduling
ฺ d t o us Working with Work Orders 2-61
ee Fundamentals
Productionja
i y seFundamentals 2-62
Scheduling
p ( v en Fundamentals complex Maintenance,
Production
e e l i c
Scheduling
y D Repair, and Overhaul 2-79
Vi j a Production Scheduling Fundamentals 2-80
3 Generating a Schedule Introduction

Generating a Schedule 3-2
Generate a Schedule Offloading, Repair, and cMRO 3-34
Offloading, Repair, and cMRO 3-35
4 Solution Architecture and Best Practices Introduction

Solution Architecture and Best Practices 4-2
5 Deployment Architecture and Technical Considerations

Deployment Architecture and Technical Considerations 5-2
Deployment Architecture and Technical Considerations
Data Model and Customizations 5-3
iii
Solution Architecture and Best Practices 5-6
Deployment and Architecture 5-17

Performance and Sizing 5-31
Deployment Architecture and Technical Considerations Publishing,
Technical Need-to-Know 5-35
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija
iv
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija
Oracle Value Chain Planning: Implement Production Scheduling 1

Implement VCP Production Scheduling

Training On Demand ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
Copyright © 2015 Oracle and/or its affiliates. All rights reserved. 2
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
This slide can also be used as a
e n
e ep lic
y D
Vi j a

VCP Production Scheduling
Course Objectives
• Who is this course for
– Intended for people who need to design, implement, support, or use the application
– Already have a basic understanding of the application. This is not an introductory course
• After this course yyou should be able to
– Create a Production Scheduling Model
– Architect a Production Scheduling Solution
– Customize or define customization specifications for the application
ble
• What you will not learn
fe r a
– Setup steps in the source system (i.e. EBS, JDE) ans
n - t r
– D b
Database to PProduction
d i SScheduling
h d li fifield
ld mappings
i o
– How to become an advanced implementer s an
– Programming skills necessary to customize ) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Program Agenda
1 Introduction
2 Production Schedulingg Fundamentals
• Editors and Basic Navigation
• Resources, Routings, and Operations ble
fe r a
• Attributes, Calendars, Changeovers ans
n - t r
• Working with Work Orders a no
h a s ฺ
• Complex Maintenance, Repair, e r u ide
) Overhaul
oand
n i cฺa ent G
a s o tud
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
De
y
Vija

Program Agenda
3 Generate a Schedule
• Introduction
• Under the Hood
• Configuration ble
fe r a
ans
• Offloading,
g, Repair
p and cMRO
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Program Agenda
4 Solution Architecture and Best Practices

• Problem Qualification
• Best Practices
5 Deployment, Architecture, and Technical Considerations
ble
• Data model and Customizations fe r a
ans
• Deployment and Architecture n - t r
o
• Performance and Sizing s an
) h a eฺ
ฺ a ero t Guid
• Publish and Technical Need-to-Know
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Introduction
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Introduction
The Changing Landscape and impacts to the Factory
Customer Service Analysis

• Evaluate the impact of a hot order • Improve
p Resource Utilization
• Shorten customer response times • Improve Demand Fill Rates and Service Levels
How • What action should I take ?
can I… e
r a bl
fe
ns
Planning t r a
Manufacturing
• Reduce WIP Inventory
no •
n-
Sequence orders to minimize time due to setups
a
s manufacturing
Consider tactical planning decisions in the schedule
•
h a
Synchronize
ฺ
• across multiple stages
e of unplanned downtime
Reduce planning cycle time
•
e r o)Minimizeutheidimpact •
n i cฺa ent G
a s o tud
p an his S
e p @ se t
y ฺ de to u
Strategies…….
( v ija nse
e p l i c e
D e
y
Vija
Empowered People

Demand Driven Supply Chain
Scheduling Challenges
Increased Customer Expectations Customer Service High service levels required
Product Proliferation Planning Impact on inventory and WIP
ble
fe r a
Volatile Demand and Supply Analysis Quick analysis required
ans
n - t r
a no
Globalization and Complexity Manufacturing
h a s ฺ Utilize existing assets
Efficiently
e r o) uide
n i cฺa ent G
a s o tud Copyright © 2015 Oracle and/or its affiliates. All rights reserved. 3
p an his S
e p @ se t
y ฺ de to u
Distribution-Centric vija se
( e n
e ep lic
y D
Vi j a
Diversified Sales Channels
Product-Mix
Lower Customer Service

Oracle Value Chain Planning
Solution
• Common foundation
• Single source of truth

• Centralized services
Planning Data Management
• Start anywhere,
h redo
d nothing
h
Engineered Systems & Solutions
Scenario Planning & Analytics
ble
Planning and Optimization
fe r a
ans
n - t r
a no
h a s ฺ
e r o) uide
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
Oracle offers ae ep deep
complete,
e broad planning solution. Even though you can implement each product stand
licand
y
alone, you Dthe foundation for the Value Chain Planning footprint as soon as you implement one – It will make it
lay
j a
Vi to deploy other products subsequently while at the same time reaping the benefits of the pre-built
easier
iintegrations.
t ti All products
d t are iintegrated
t t d within
ithi th
the planning
l i solution
l ti b butt also
l iintegrated
t t d with
ith other
th subb systems
t
such as Oracle ERP, CRM, Financial Planning, CRM, as well as has the ability to integrate with non Oracle systems.
For now, I just want you to know that Oracle Value Chain Planning is a
COMPLETE solution that shares a
COMMON FOUNDATION and PLANNING DATA MANAGEMENT and is the
SINGLE SOURCE OF TRUTH for all planning decisions
(and that also have been designed to perform in the best possible way on the Oracle Engineered Systems)

Oracle Value Chain Planning
Solution
• Common foundation
• Single source of truth Risk Event

Management Driven Production
• Centralized services Inventory
Simulation Scheduling
Supply
p
Postponement VMI
• Start anywhere,
h redo
d nothing
h Network Sales and
Planning
Operations Collaborative
Design
Planning Planning
Demand Service
Distribution
Management Parts
Planning
Planning
Trade
Management
Planning
Global
Order
ble
Demand
Analytics
Promising
fe r a
Signal Management
s User
tran
Workflow
Roles
Oracle
Database
o n - Collections Web
SServices
i
Menus
s an WLS Security
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
Oracle offers ae e
complete, l and broad planning solution. Even though you can implement each product stand
deep
alone, you D
y lay the foundation for the Value Chain Planning footprint as soon as you implement one – It will make it
i j a
V deploy other products subsequently while at the same time reaping the benefits of the pre-built
easier to
iintegrations.
t ti All products
d t are iintegrated
t t d within
ithi th
the planning
l i solution
l ti b butt also
l iintegrated
t t d with
ith other
th subb systems
t
such as Oracle ERP, CRM, Financial Planning, CRM, as well as has the ability to integrate with non Oracle systems.
For now, I just want you to know that Oracle Value Chain Planning is a
COMPLETE solution that shares a
COMMON FOUNDATION and PLANNING DATA MANAGEMENT and is the
SINGLE SOURCE OF TRUTH for all planning decisions
(and that also have been designed to perform in the best possible way on the Oracle Engineered Systems)

Value Chain Planning Solution
How to get the most out of your assets ?
• Answer the tough questions

– What is the best way to satisfy
demand ?
– How do I resolve my resource
p y issues ?
capacity
– How can I reduce inventory ?
– When do I need to start production ?
bl e
fe r a
an s
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Advanced Supply Chain Planner Production Scheduling
• Advanced Supply Chain Planner

– Balance your supply chain
considering resource capacity, and
sourcing rules
– Align
g materials and purchasing
p g
recommendations
– Generate production planned orders
When
What
bl e
fe r a
Where
t r a
ASCPns
no n- Why
a
s ฺ
h a Who
e r o) uide
n i cฺa ent G
a s o tud
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
De
y
Vija

Advanced Supply Chain Planner Production Scheduling
• Production Scheduling
– Consider tactical planning guidance
from Advanced Supply Chain
Planning
– Balance tradeoffs between missingg
demand, carrying inventory, and
Vs. changeovers
– Sequence orders to maximize
throughput
bl e
fe r a
ns How
Capacity
t r a
no
Gain n- ?
a
ASCP
s ฺ PS
h a
e r o) uide
n i cฺa ent G
a s o tud
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
De
y
Vija

Oracle Production Scheduling
Maximize throughput and sequence intelligently to improve resource utilization
• Maximize throughput of bottleneck resources

– Synchronize across different production stages
– Minimize setup with intelligent sequencing
• Improve shop floor performance
– Easy identification of issues
– Manual drag and drop scheduling
• Quickly determine the best schedule
– Rapid What-if scenarios
– Scenario comparison and key performance indicators
ble
• Was Late, Now on-time; Was on-time, now late; Was Late - Less Late; Was Late –
More Late
fe r a
• Implement quickly by leveraging out-of-the-box
ans
integration
n - t r
– Integrated
I t t d manufacturing
f t i planning
l i and d scheduling
h d li withith ASCP
o
– Fully integrated with Oracle E-Business Suite, JD Edwards
s an
– Schedule Maintenance Visits and Work Orders with CMRO
) h a eฺ
ฺ a ero t Guid
s o nic den Copyright © 2015 Oracle and/or its affiliates. All rights reserved. 9
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Vija
Dy
ee p
j a
l
y
e
(vi icens
e p @
ฺd e to u
a
s
n
e
a s
p thi
o
s S
ฺ a
tu
)
nic den
h s
ero t Guid
a eฺ
an
on - t r an
s
fe r a bl
e

Editors and Basic Navigation
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Topic Objectives
• At the end of this section you should be able to
– Access and use the following editors

• Supply/Demand Editor
• Work Order Editor
• Resource Relationship
l h Editor
d
• Changeover Editor
• Calendar Editor
– Navigate around the Production Scheduling UI
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Navigation
• All editors are accessible in the workspace
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Editor overview
• Editors are used to View, add, edit, delete data
– Supply/Demand editor.
• Demand typically a sales order, forecast, or safety stock demand
• Supply typically a purchase order or planned order
– Work Order Editor.
• Work order header and operation information
– Resource Relationship Editor
• For Multi-Stage synchronization models only.
ble
• Typically when a resource relationship exists due to a physical connection (Pipe, blowline, hoses etc.)
fe r a
s
n - tran
• The following editors will be discussed in greater detail in the later sections
o
– Calendar editor. Represents availability of time based on workdays, shifts
s an
– Changeover editor. Used to model sequence dependent setups.
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Demand Editor
• Demands: Customer orders, forecast, safety

– Some fields on header & line item level
– Order Class (3) and Priority (5) allow 15 priorities
– Target Completion Date: Overrides Request Date
– Satisfaction Date: Populated by integration if pegged ASCP
planned orders are outside PS horizon; PS then ignores
these demands
• Data can be added, edited, deleted for simulation

purposes
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Supply Editor
• Supply Types
– Purchase Order, Internal Requisition
– Planned Transfer, In Transit
• Earliest Date
– Supply cannot move before this date
– Dependent consuming demands (downstream) will be
delayed if necessary
– Set the Earliest Date to material’s lead time for all supply
events outside that lead time ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Resource Relationship Editor
• Only relevant in multi-stage synchronization

modeling
• Direct physical resource connectivity between
resources typically seen in “Make-Pack” situations
common in Food & Beverage and Consumer
Goods.
• Often a result of physical connections, plant
layout, or engineering considerations.
ble
• 3 different relationships possible
fe r a
– Direct feed required: Pack line must be fed directly (e.g. if
ans
Pack line outruns non-direct feed mechanism due to its
n - t r
speed and high WIP item consumption rate)
rate).
o
– Direct feed possible: Pack line can be fed directly and also
s an
indirectly.
) h a eฺ
ero t Guid
– Direct feed not possible: Pack line must be fed indirectly.
ฺ a
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
D
V ijay

Work Order Editor
• Most common Editor used

• Different work order types
– Production Work Orders (Discrete, OPM, OSFM, JDE)
– Maintenance Work Orders (CMRO)
– EAM Work Orders (EAM)
• Planned Orders from ASCP arrive as ‘Work Orders’

in Production Scheduling
• Same folder structure will be used in Production ble
Pegging view fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Order Editor
• The work order header has basic information such

as routing, item, request date, and completion
date
• Work Order priority is modeled using 2 fields
– Order Class (3)
– Priority (5)
• Within each Order class you can have 5 priorities

so there are 15 possible priorities
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Order Editor
• The work order details has the information you

would expect such as operations, resources,
materials, duration, etc.
• Some of the key fields are highlighted to the right
• For the details on the fields, see the user guide
• Most of the information is imported in the
standard integration
• Work order dates are published back to EBS ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Scenario Properties
• Scenario properties hold information on
the model such as

– Name, precision, available UOM’s
– The most common information is the
scheduling
h d li H Horizon
i
– The start and end date bound the scheduling
horizon
– The first cycle start time is used to define
ble
typical start date for bucketing purposes. For
example, set to a Monday if the start of the fe r a
week starts on Monday ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Solver Options
• This contains general application
behavior including algorithm selection

and optins
• This will be covered in greater detail in
subsequent sections
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija


Resources, Routings, Operations
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Topic Objectives
– Understand key data for Production Scheduling

– How to access each data element and their properties
– What data is typically included in the standard integration
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic denCopyright © 2015 Oracle and/or its affiliates. All rights reserved. 14
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Scheduling Data
• The data required for Production Scheduling can be split into 2 categories
• In both cases, the data is input into the application. PS does not ‘own’ the data
Scheduling Master Data Dynamic/Transaction data
• Items • On hand
• Machines, Crews, Tools • Supplies
• Attributes • Demands
• Shop floor calendars • Work orders
• Suppliers • Reservations (supply and demand) ble
• Changeover rules • Safety Stock
fe r a
• Routings
ans
• Operations
n - t r
o
an
• Resource groups
h s
a eฺ
)
ero t Guid
**Note, This is not be a comprehensive list of data elements
ฺ a
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Scheduling Data
• Resources
– This term is used broadly in PS and represents

• Items
• Machines (Resources)
• Crews
• Tools
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Items
• Overview
– Includes components, Finished Goods, and WIP

– Item information is imported in the standard
integration from the source systems including
On-Hand Safety Stock,
On-Hand, Stock Cost
– Also will include Lead Times (if purchased).
Note, the Lead time is taken from the item
master and NOT the ASL
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Items
• Different unit of measures can be
assigned
– This is for display only, there is no UOM
conversion in PS
– UOM conversionsi mustt be
b implicitly
i li itl
established within model data and achieved
with appropriate operation input/output
relationship definition
• Display Precision: Determines the ble
number of decimals for any item fe r a
ans
quantities within model
n - t r
o
• Maximum: Storage Maximum and
s an
Shared Storage Space is Never treated as
) h a eฺ
ero t Guid
constraint
ฺ a
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Items
• On-hand inventory is considered during
planning.
• There are no sub-inventory locations,
each item will have a single on-hand level
only by orangization
• Inventory reservations to on-hand
reservations can also be considered
during planning ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Items
• Cost data
– Considered by Campaign Run Optimization

algorithm only, otherwise it is not used by the
application.
• Item Type – Determines how an item can

be used within model:
– Saleable: Demand (Sales order or Forecast)
ble
– Manufactured: Work order fe r a
– ans
Purchased: Purchased Supply
n - t r
– Rebuildable: EAM work order o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Resources
• Resources
– Different Resource Types in PS include

Machines, Tools, and Crews
– Resource information is imported from the
source system
– The relevant
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Resources
• Last Operation Run: Allows the
application to understand the

appropriate changeover at start of
horizon
• Capacity Type
– Single Capacity: If only 1 resource
– Multi-capacity: If units > 1, are identical and
changeovers are irrelevant and manual
ble
scheduling is not required on these resources
fe r a
– Batchable: Allows concurrent processing of
ans
different operations
p if theyy share keyy attributes
n - t r
o
• Dynamic Capacity: Typically only for
s an
varying crew levels (i.e. across shifts)
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Resources
• Calendar is established based on the
resource availability considering the shop

floor calendar, shifts, shift patterns, and
exceptions (i.e. Holidays)
• Fixed Time Fence
– Only firm work orders will be scheduled within
the fixed time fence
– Option to respect Firm dates, irrespective of
ble
constraints
fe r a
• Cost data used only by Campaign Run ans
Optimization and for display in KPI view n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Resources
• Different options to influence scheduling
behavior
• Offload Threshold: Has impact only if the
Prebuild Target is specified
• Capacity Constrained Resource: Theory
of Constraints
• Minimize idle time when using prebuild: e
Reduces idle gaps in schedule r a bl
s fe
- t r an
on
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Resources
• Attributes are used for attribute-based
changeover rules
• If multiple attributes are in use, then you
can specify how the schedule should
consider the time:
– Concurrently: Changeover time equals
maximum time for all attribute changes (e.g.
product type and pack size change at same
ble
time)
fe r a
– Sequentially: Changeover time is the sum of
ans
the times for each attribute change
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Routings & Operations
• Routings & Operations is the most critical • Example.

data element in the application. – Routing with 2 Operations
– Scheduling behavior is dictated by the routing – Operation 10 and Operation 20 uses Machine 1
– Poor schedulingg results are usuallyy a result of p y
and Machine 3 respectively
routing structures that are not structured for – Operation 10 consumes Component A
scheduling
– Operation 20 Produces Item #1
• A PS Routing is a marriage of the Bill-of-
Material and resource centric “Routing”. ble
A common industry term for this is a fe r a
Work Definition. ans
n - t r
• When referring to Routings, we are o
referring to the PS Routing which has s an
both resources and materials ) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Routings Properties
• Routing Type
– Production: Typical
– Maintenance: Does not have to produce an
item
• Use this Routing for Work Orders only
– If checked, then the application cannot
instantiate this routing to satisfy demand
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Routings Properties
• Schedule Work Order operations to their
unit of effort
– Allows feeding the downstream operations by
production lot multiples versus by complete
Work Order Quantity
– Must be checked when batch resources are in a
routing
Without Unit of Effort
ble
fe r a
With Unit of Effort
ans
n - t r
o
s
Adjacent Operations Preferred an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Routings Properties
• Consistent resource assignments
– When a resource is selected amongst a

selection of alternates, use this resource across
operations
– This avoids switching between resources
– This cannot be defined at source so must be a
customization
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Routing Precedence Relationship
• The link between the routing defines the
precedence relationship between the

operation
• By default it is S>E (Starts After End) in
the standard integration
• Some configurations allow other
precedence relationships to be defined
but PS supports more than what can be ble
defined at source -> customization would fe r a
be required in these cases ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Production Scheduling supports
– Starts After End (with Min/Max Separation)

– Starts At End
– Starts After Start (with Min/Max Separation)
– Starts At Start
– Ends At End
• With this parallel, or network routings can be defined within the application
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Examples:
– Starts After End

• Min Separation < t < Max Separation
• In EBS, Min & Max Separation Cannot be
defined
• Min defaults to 0, Max defaults to infinity
– Starts At End
• t = 0, contiguous production
ble
– Starts After Start
fe r a
• Min Separation < t < Max Separation
ans
• In EBS,, Min & Max Separation
p Cannot be
n - t r
o
an
defined
• Min defaults to 0, Max defaults to infinity
h s
a eฺ
)
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Examples:
– Starts At Start
• t=0
• Operations must start at the same time
– Ends At End ble

• Operations must end at the same time fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Operations
• Establish relationships between the
various resources in the model

– Contain BOM and Routing information
– Anatomy of the operation diagram
• In PS, all resources consume the same time as
the duration resource. In the example, the WIP
Operator consumes 1 hour. The same as the
Packaging Line.
• Resources that are not the duration resource
ble
are referred to as supporting resources (WIP
fe r a
Operator in this case)
ans
• Operation
p consumes 1906 LB of ‘Peanuts –
n - t r
o
an
Salted Bulk’
• Operation produces 100 EA of ‘Salted Peanuts –
60z’ h s
a eฺ
)
• The Lot Multiple is 1
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Operations
• The Lot Multiple is a fundamental concept and
should represent manufacturing process

constraints such as batch production, size of a
pallet, size of a Tray.
• In most high
g volume manufacturingg
environments, product is made in these logical
lots versus individual units
– Logical lot multiples should reflect the realities of
the manufacturing process must be determined
ble
carefully
fe r a
– Too large => it will limit flexibility
ans
– Too small => will cause scalability issues
n - t r
o
• The duration resource and lot multiples are
defined on the arc from the resource to the s an
operation ) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Operations
• In the example below, each instance of
this routing will

– Produce Lot Multiple x Qty Produced = 1 x
100EA = 100EA of Salted Peanuts – 6oz
– Consumes
C LLott M
Multiple
lti l x Qt
Qty C
Consumed
d=1x
1906LB = 1906LB of Peanuts – Salted Bulk
– Would consume 1 Hour of Packing Line 1
– Would consume 1 Hour of WIP Operator (recall
ble
that supporting resources consume the same
amount of time as the duration resource) fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Operations
• If the Lot multiple is changed to 2 (with
duration still 1 hour) than each instance

of this routing will
– Produce Lot Multiple x Qty Produced = 2 x
100EA = 200EA of Salted Peanuts – 6oz
– Consumes Lot Multiple x Qty Consumed = 2 x
1906LB = 3812LB of Peanuts – Salted Bulk
– Would consume 1 Hour of Packing Line 1
• NOTE, even though the Lot Multiple has ble
changed, the duration is simply the duration 2.000
fe r a
specified on the resource. In other words, the
ans
duration is the time it takes to produce a Lot
n - t r
o
an
Multiple worth of production.
– Would consume 1 Hour of WIP Operator (recall
h s
a eฺ
that supporting resources consume the same )
amount of time as the duration resource)
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Operations
• In the standard integration, the lot
multiple is established in the following

priority
1. The minimum of all “Charge quantities” for
resources within a routing (OPM Only)
2. The MTQ of the first operation of the routing
3. Fixed Order quantity of the primary item
produced by the routing
4. Fixed Lot multiple of the primary item ble
produced by the routing
fe r a
ans
5. Minimum Order quantity of the primary item
produced by the routing n - t r
o
6. Maximum Order quantity of the primary
s an
item produced by the routing
) h a eฺ
7. Value of 1
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Operations
• Alternate resources are modeled using
Resource Sets.
• Resource Replacement Groups are
represented using All-Of-Sets, in example:
• Preferred choice: Gold Crew with Cutter
• Second choice: Silver Crew with Cutter Green box
• “All-Of-Sets” in PS is mapped to “Resource indicates

preferred
Replacements Groups in EBS” choice
ble
• In the example, the Gold Crew will fe r a
consume 0.5 hrs since the cutter is the ans
duration resource.
resource Similarly,
Similarly the Silver n - t r
o
Crew will consume 0.75 hrs.
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Operations
• Terminology.
– In EBS, the lowest level in a Operation is an

activity. An operation can have multiple
activities.
– In PS
PS, the most granular definition is an
operation so an EBS activity maps to a PS
operation.
• In PS, the operation Code will include a
concatenation of Operation : Activity such ble
as 10:10, 10:20, 20:10, 20:20 as in the fe r a
ans
example
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Demonstration
• How to add, view, and change
– Items
– Machine, Tool, and Crews
– Operations
– Resources
– Demand
– Scenario Properties
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 1. Basic model building (30 min)
• Create a model. Your discrete manufacturing company produces only one item 0815
– Manufacturing process description

• Step 10: Production
– Consumes Material XYZ,
Crew ((60 min))
– Runs either on Machine 1 (30 min) or Machine 2 (45 min)
• Step 20: Testing RM ABC 10 20 FG 0815
– Delivers item 0815 Machine 1 (30’)
or
– Requires testing crew only (60 min) Machine 2 (45’)
• Testing crew ble
– 2 people
fe r a
– Horizon: 3 months an s
n - t r
– Demand: 25 units at end of horizon o
– Solve and examine the model to ensure you understand it s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 1 Solution
• Workspace should have the following elements or • Operations and Routing setup
similar
S>E
• Solved model in Resource Gantt ble

fe r a
ans
n - t r
a no
h a sdoes notฺlook exactly
ide
) try merging/unmerging
Tip. If your schedule
r ofrom
like the above
e u
cฺa ent G
operations the toolbar
n i
o tud
s
a
an his S
p
@ se t
e p
y ฺ de to u
( v ija nse
e p l i c e
De
y
Vija

Exercise 2. Impact of Lot Multiple (30 min)
• Using the model from Exercise 1
• Change demand to 250. Solve again.

Exercise 2a • Observations?
• Change demand to 1000. Solve again.

Exercise 2b • Observations?
bl e
• Keep demand at 1000, change routing/operation lot multiple to 10. Make sure to ra
change the lot multiple on all operations so that it is consistent. Solve again. fe
Exercise 2c • Observations?
t r a ns
o n -
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 2. Solution
• The Lot Multiple impacts the number of
operations that are scheduled. In

general, more operations -> Longer solve
times.
–N
Note,
t there
th are other
th ffactor
t ththatt iimpactt solve
l
times
• In 2c, even though the demand was 1000.
A lot multiple of 10 means that you need
ble
10 times less operations to satisfy the
fe r a
demand
ans
• The progress log is a good utility to n - t r
o
understand the number of operations
s an
that are in your model
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija


Attributes, Calendars, Changeovers
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Topic Objectives
– Setup and use Attributes for scheduling

– Add and modify calendars
– Setup and use changeovers
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Calendars
• Calendars help represent resource
availability in Production Scheduling

• In Production Scheduling a resource is
either available or not. It does not
matter why a resource is not available
(i.e. holiday, shutdown, regular shift
patterns.
• Each resource can have a unique calendar e
r a bl
• When a resource is down, there are 2
s fe
types of ‘calendar events’.
- t r an
– Delay: Operations can be interrupted and can on
continue afterwards (Default)
s an
– Down: Operations cannot be interrupted.
) h a eฺ
Once started, it has to complete.
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Calendars
• Calendars can be edited to simulate
overtime, unplanned downtime or any

other event that impacts the availability
of a resource
• In the Gantt charts, the calendar events
are represented by thick lines
• Calendar assignment is a resource
property ble
fe r a
• In the standard integration, the calendars
ans
are derived from
n - t r
o
– Manufacturing calendar, shift patterns, shift
s an
exceptions, workday patterns
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Attributes
• The concept of attributes is fundamental for

scheduling. Most ERP systems are item based but
manufacturing production is often grouped by like Minor Major Minor
properties such as temperature, size, color, grade

etc
etc…
– Grouping by Item/SKU is not good enough
• There is often more than 1 attribute that defines
changeovers. In the example to the right,
bl e
– Flavor change is a major changeover (more time)
fe r a
– Size change is minor
ans
• O n - t r
On th
the resource, multiple
lti l changeovers
h can b
defined as either concurrent or sequential
be
a no Sequential
Concurrent
h a s ฺ Minor Major Major
o) uide
Minor
e r
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
D e
y
Vija

Attributes
• Attributes are assigned to Items,
Operations, and Resources

• In the standard integration, setup types
are mapped to attributes but only 1 setup
type can be defined
• Customizations for attributes is very
common and necessary if:
– Changeovers are triggered across more than 1 ble
attribute fe r a
ans
– Colors are used to help visualize the schedule
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Attributes
• To enable colors, you need to specify an
attribute highlight order

• To view colors in the Gantt you can toggle
on and off from the toolbar
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Changeovers
• An attribute changeover matrix can be
defined / imported in Production

Scheduling
• The changeover matrix is generated from
th setup
the t ttypes iin EBS
• Changeovers can be defined by resource
for 1 or more attributes. In the example:
– Changeovers are defined for the ovens ble
– Grade temperatures trigger a 4hr changeover fe r a
ans
from any attribute value to any attribute value
((* indicates all) n - t r
o
– Temperature changeovers depend on From/To
s an
– The cost of the changeover is relevant only for
) h a eฺ
CRO (Campaign Run Optimization)
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Changeovers
• User defined changeovers can be defined
when using Campaign Run Optimization

(CRO)
• Changeovers will follow the user defined
sequence within the CRO bucket
• In the example to the right, for each
Grade it will cycle through the
Temperature in the order specified ble
– Within Grade A, cycle through Temperature fe r a
ans
560->600
n - t r
– Within Grade B, cycle through Temperature o
560->600
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 3. Calendars (15 minutes)
– The testing crew is available from Monday to Friday from 8am to 5pm.
– In this factory, operations that are started need not be contiguous (operations can stop and than
continue at a later time)
• Change the model to reflect the business realties noted above and solve the model
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• The calendar should look similar to this
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 4. Attributes (45 minutes)
– Add 2 more FG items FG 0816, FG0817

– The routing structure for the items will be the same (duplicate the original routing as a shortcut)
– Add an attribute, Size with 2 values Large and Small
– Add colors to the attributes
– Assign the attributes to the items, operations, and resources. FG 0815 = Small and the remaining
items = Large
– Add demand = 25 for the new items
ble
– Solve fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Walkthrough
– Properties for an Item, Operation, Machine/Resource, and attributes are shown below.
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 5. Changeovers (15 minutes)
– Add the following changeovers

• Large => Small 1 hr
• Small => Large 2 hr
• Tip. Setup a resource Group to minimize the
h setup off the
h changeover
h matrix
• Solve the model and review/understand the schedule
– Change the changeover time from Large=>Small to 5 hrs
• Solve and review the schedule
ble
• Observations ?
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• You can specify changeovers by resource group to minimize the number of records
ble
• Changeovers are inserted at each change in Size. fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija


Working with Work Orders
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Topic Objectives
• At the end of this section you will be able to
– Interpret work order data

– Influence the schedule based on work order properties
– Explain the difference between Work Order Routings and Routings
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Orders
• Work orders are the currency of communication between Production Scheduling and
the different systems

– Work orders are imported from the different source systems
– In an integrated environment, planned orders from ASCP are passed to Production Scheduling as “work
orders”.
d ” Wh When released
l d ffrom PS
PS, workk orders
d are created
t d ffrom planned
l d orders
d
– Work order dates from PS are updated in EBS
Planned orders from ASCP ble

fe r a
ans
Work orders that are candidates for re-scheduling by PS
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Orders
• From the Demand Editor, you can quickly
create work orders from demands. 1

work order will be created for each
Demand Line Item
• This is useful for proto-typing or scenarios
only as work orders will typically be
imported automatically from the source
system
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Orders
• They key information on the Work Order Header is highlighted below
• Most is self explanatory or explained prior. What is unique to PS:

– Routing Instances Required is dependent on the Lot Multiple. Since the Lot Multiple = 50 and
Required = 260 you will need 6 routing instances (6 x 50 = 300) as 5 routing instances would only
produce 250
– Target Completion Date overrides request date if defined.
– Earliest Start Date. Earliest date that a WO can be scheduled.
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Orders
• Work Order Details: Operations
– Firm Status: Valid values are Firm Start, Firm Range, Firm End
– Actual Start/End Date
– Planned Start/End Date
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Orders
• Work Order Details: Precedence Constraints
– Precedence relationships between operations

– Starts After End, Starts After Start, Starts At End, Ends at End, Starts at Start
– Min and Max separation can be specified
– Prior/Next in EBS is mapped to a precedence constraint
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Orders
• Work Order Details: Bill of Resources
– Resources on a Work Order by Operation

– Lists the Planned and Actual Resource
– Option to Allow/disallow offloading to alternates
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Orders
• Work Order Details: Bill of Materials, Produced Item
– Contains bill of material information including quantity required

– Support of co-products (can have multiple produced items)
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Orders
• Work Order Details: Supply/Demand reservations
– You can hard-peg a work order to a demand or supply

– It is possible to reserve any supply type to any demand type but only the following are supported as a
part of standard integration
• On-Hand
O H d IInventory
t tto a SSales
l O Order
d
• Work Order to Work Order reservations
• Internal Requisition to Work Order
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Order Routings
• When a work order is created, the initial material and resource usage is obtained from
the Bill-of-Material and Routing

• Once created, a work order can evolve. For example, use a resource that is not on the
routing, usage quantities, additional alternates, removal of alternates etc.
• In Production Scheduling, the original BOM and Routing definition is considered the
master data. This is commonly referred to as the Routing Template
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Order Routings
• Why ?
– The Routing Template carries some important scheduling specific master data such as
• Attributes, Costs, Operation Types
– These are used by some scheduling specific algorithms and do not exist in ERP
– The work order will inherit this data for scheduling purposes
• There is logic in PS that will try to match the Work Order to the Routing Template to
inherit these critical attributes
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Order Routings
• Because of the reliance on the Routing Template for schedule quality purposes, only
basic Work Order information is passed in the integration. The rest of the information
will come from the template
• Example
– Only primary resource on the Work Order Routing is passed in the integration, the alternates are taken
from the template if there is a ‘match’
Item Routing Work Order Routing In PS

~ Primary
resource
ble
~ Alternate R R R R R R R
fe r a
resource 1 2 1 2 3
Add R3
1 2
ans
~ ResourceSet
n - t r
o
aOp n10
~ AllOfSet
Op 10
h s
Op 10
a eฺ
)
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Work Order Routings
• If there is no ‘match’ found for a routing template a routing will be auto-generated
based on the basic work order data

• Example
– Operation Code is a key field for matching
Item Routing Work Order Routing In PS

~ Primary
resource
ble
~ Alternate R R R R
fe r a
resource 1 2 1 1
ans
~ ResourceSet
n - t r
~ AllOfSet
a no15
Op
Op 10
h a s ฺ
Op 15
e r o) uide
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
De
y
Vija

Exercise 6a. Work Orders (45 Minutes)
a. Solve the model. Examine the schedule in the Resource Gantt

b. Open the Routing Properties. What is the unit-of-effort flag set to ?
c. Check the solver options, ensure Schedule Work Orders by their Unit of Effort is set to By Routing
d. Create a work order from the demand editor

e. Examine and understand the work order that is created. Where did the work order details come from ?
bl e
f. Solve the model. Examine the schedule in the Resource Gantt. What changed from a) and whyf?e r a
g. Go to the work order, what is the Routing Instance Required ? Why ?
t r a ns
h. In the Routing Properties, uncheck the flag to schedule by unit of effort. Solve ando n -
examine the schedule.
What happened and why ?
s an
i. Go the the work order, what is the Routing Instance Required ? Why h ?a ฺ
o ) i d e
ฺ a er t Gu
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
D
V ijay

Exercise 6a. Walkthrough
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 6b. Work Orders and Routings (30 Minutes)
• Using the model from Exercise 6a
a. Open the Routings in the Model Workspace. How many routings are their ?
b. Open the work order editor. Which routing is the Work Order referencing ?
c. Open model Exercise 6b.xml. How many routings are there ?
d. Open the work order editor, examine each work order.
a) Which Finished Good is the Item Producing ?
b) Examine which routings the work orders reference. Why is there a difference ?
c) What is the difference in Work Order 000002-1 ? 000003-1 ?
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 6b. Walkthrough
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija


complex Maintenance, Repair, and Overhaul
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Complex Maintenance, Repair, and Overhaul
• Maintenance Work Orders from cMRO can be scheduled considering Visit Details,
Milestones and user defined Work Breakdown Structure

– Visits: Logical group of maintenance Work Orders performed on equipment, such as an engine or
vehicle (aircraft) and defines the arrival and request date of the maintenance work to be performed
– Work
W k Breakdown
B kd Structure:
St t D
Defined
fi d usingi new attributes
tt ib t on W Workk O
Orders
d ffor organizing,
i i filt
filtering,
i and d
establishing task dependencies
– Milestones: Indicates the end of a Stage and allows for the ability to define task hierarchies via Stage
Rules
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Complex Maintenance Visits can have work
breakdown structures with a large volume

Inspect
of work orders
Remove
– Complex work order inter-dependencies
– Shared resources and materials across work
D
Depanel
l L bi t
Lubricate T t
Test I t ll
Install
Wing
orders
Load Test
• Lack of an effective maintenance visit
Speed Test scheduling tool can result in
– Delays in visit completion
ble
Engine Inspect
– Incorrect visit schedules
fe r a
Test
Rotation
Test Tilt
– Limited visibility into resource capacity and ans
Tail Test
material shortages n - t r
no
Speed
p Test
Measure Replace Clean
Hi Speed Lo Speed No motion

a – Limited visibility into equipment and tool
Test Test test
h a s ฺ Seal Cover Lubricate

downtime
) ability detoschedule
Lubricate
–o
Measure
e r Limited
u ithe react to changes quickly
n i cฺa ent G
and adjust
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
D e
y
Vija

• Schedule complex maintenance visits taking into account
– Visit start / end dates

– Visit milestones & key dates
– Task hierarchies / complex precedence constraints
– Work breakdown structure
• Model key constraints on the shop floor
– Crew, machine, tool capacity and downtime
ble
– Material / Rebuildable item constraints
fe r a
• Make and analyze schedule changes rapidly ans
n - t r
– EEasily
il id
identify
if critical
i i l path
h to d
determine
i ‘Wh
‘Why a visit
i i iis llate?’
?’ o
– Powerful solver provides near real time response s an
– Alerts and KPIs designed for Maintenance schedulers ) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Demonstration
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Vija
Dy
ee p
j a
l
y
e
(vi icens
e p @
ฺd e to u
a
s
n
e
a s
p thi
o
s S
ฺ a
tu
)
nic den
h s
ero t Guid
a eฺ
an
on - t r an
s
fe r a bl
e
Generating a Schedule
Introduction
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Topic Objectives
– Articulate the difference between planning and scheduling

– Identify the different scheduling algorithms
– List the pros and cons of each
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Planning versus Scheduling
• Planning (Mid to Long term) is typically done using time ‘Buckets’ in Days, Weeks or
Months
– Order of tasks within a bucket is not considered. Only whether overall capacity is sufficient.
– From a scheduling perspective, the example below is not executable
Bucket = 1 day
R1 10 10 10
R2 20 20 20
R3 30 30 30
ble
fe r a
ans
n - t r
n o
• With scheduling, the sequence of jobs can have a major impact a
s on ฺresource availability
h a
e r o) uide
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
y De
Vija

• Red, White, Blue ≠ White, Blue, Red
R1 10 10 10
20 Completed
R2 20 20
Earlier
30 30 30
R3
Capacity ‘gain’
R1 10 10 10
R2 20 20 20
ble
R3 30 30 30
fe r a
ans
• With 3 distinct routings
routings, there are 3! = 3 x 2 x 1 = 6 possible combinations n - t r
o
an
• With 10 distinct routings, there are 10! = 3,628,800 possible combinations.
h s
a eฺ
)
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Red, White, Blue ≠ White, Blue, Red
R1 10 10 10
20 Completed
R2 20 20
Earlier
30 30 30
R3
Capacity ‘gain’
R1 10 10 10
R2 20 20 20
bl e
R3 30 30 30
fe r a
ans
Now consider the following Changeovers
• With 3 distinct routings

routings, there are 3! = 3 x 2 x 1 = 6 possible combinations n - t r
no
Resource From To Time
• With 10 distinct routings, there are 10! = 3,628,800 possible combinations.
a
s ฺ
R1 White Blue 15 min
h a R1 Blue Red 30 min
e r o) uide R1 Red White 90 min
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
D e
y
Vija

• The impact of changeovers will have a big impact on the schedule
– In the first example, what was once ‘bucket feasible’ is no longer feasible once sequence is considered
R1 10 10 10
20 Completed
R2 20 20
Earlier
30 30 30
R3
Not feasible since it does not fit in the bucket

ble
R1 10 10 10
fe r a
R2 20 20 20 Completed
Earlier
ans
R3 30 30 30
n - t r
o
s an Capacity ‘gain’
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• The impact of these efficiencies are dramatic as the number of jobs increase
– Grouping like jobs together provides increased available capacity
R1
R2
R3
Capacity ‘gain’
R1
ble
R2
R3
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• The complexity of the problem increases dramatically
– With 3 distinct routings, there are 3! = 3 x 2 x 1 = 6 possible combinations

– With 10 distinct routings, there are 10! = 3,628,800 possible combinations
• If Operation
p 10 has 1 Resource Alternate ((R4))
– With 3 distinct routings + Alternate on OP10, there are 6! = 720 possible combinations
– With 10 distinct routings + Alternate on OP10 there are 20! = 2,432,902,008,176,640,000 possible
combinations
• This is a ‘simple’ example and does not consider material availability, resource a b le
e r
calendars, complex precedence constraints, Demand priorities… nsf a
o n -tr
a n
• Scheduling is a difficult problem! s
) a
h deฺ
o
er t Gui
ฺ a
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Under the Hood
• Production Scheduling includes a number

of scheduling algorithms which is
sometimes referred to as the engine, or
solver
l
• Irrespective of which algorithm, PS is a
demand driven application so Request
Date and priorities will play a critical role ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Under the Hood
• The core engine is referred to as the CSP
(Constraint Satisfaction Problem)

• There are additional algorithms within CSP
the CSP engine that is used to solve very CSP
specific business problems
– CRO: Campaign Run Optimization
–
CRO Multi cMR
DRA: Dynamic Resource Allocation
DRA -
– Multi-Stage Synchronization: O erable
– cMRO: complex Maintenance, Repair, and Stage nsf
Overhaul
n - tra
• You can complement only 1 other
a no
algorithm. For example, you cannot use
h a s ฺ
CRO and DRA simultaneously
e r o) uide
n i cฺa ent G
a s o tud
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
y De
Vija

Under the Hood
CSP CRO Multi-Stage Dynamic cMRO

Synchronization Resource
Allocation
Targeted • Over arching • Repetitive Flow • Make/Pack type • Environments where • Maintenance
S h d li
Scheduling solver
l with
i h an manufacturing
f i f i
manufacturing l
alternate resources h d li problems
scheduling bl
Problem emphasis on • Focus on single, environments and alternate with complex
discrete bottleneck • Batch-based resource selection is precedence
manufacturing manufacturing stage manufacturing in make- critical and override relationships and
where changeover stage, rate-based changeover milestones
optimization is manufacturing in pack- concerns
bl
• Schedule all resources e
critical stage
fe r a
• Scheduling problems
• Schedule make/pack
s
with project-like
an
resources only
• Typically
yp y Food &
n - t r
structures with many
related tasks and
o
an
Beverage or Consumer dependencies
Packaged Goods
h s
a eฺ
)
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Under the Hood
Allocation
At the core • Various • LP based algorithwhich • Forward dispatching, • Forward • Forward dispatching
heuristics, rule sets guideposts to the simultaneously dispatching • Must contain Visit
g
based algorithms CSP consideringg pairs
p of • Priorityy driven
operations on make decision making
and pack stage
• Only consider
resources in Resource
Relationship Editor
bl e
Event based • Yes • No • No • Yes • Yes
fe r a
Costs • Irrelevant • Significant • Irrelevant • Irrelevant s
• Irrelevant
an
Resources • Considers all • Single capacity and batch • Considers all resource • Considers all
n - t r
• Considers all resource
resource types
t resources onlyl t
types resource types
t
o t
types
• Supporting resources
play a limited role. The s an
) h
CRO resource will dictate a eฺ
the schedule
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Under the Hood
Allocation
Consideration of • Local/Opportunistic • Global changeover • Consider simultaneous • Similar to CSP, • Forward
changeovers changeover optimization – changeovers across dispatching dispatching
optimization only – Performed in multiple stages algorithm with local • Must contain Visit
Separate from conjunction with • User Defined sequence changeover • Priority driven
resource selection resource selection MUST be specified on consideration decision making
• Changeover time • Changeover time, the Packing line
only, no costs costs, or ideal
sequence can be
bl e
used
fe r a
Work Order • No • Yes, cost based • No • No
t r•a
No
ns
Alternate
on-
Routings
s an
Resource
Offloading
• Weak • Strong • Strong
) h a eฺ
• Strong • Weak, same as CSP
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Under the Hood

Allocation
Material constraint • Yes • Limited, Material • Limited, only on pack • Yes • Yes
consideration
id i considered
id d stage
available if it is
available at the
start of the
bucket
ble
Minimum Run Lengths • No • Yes • No • No • No
fe r a
an s
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Under the Hood
• There are a set of solver options, some

specific to a particular algorithm CSP
• The number of solver options can be CSP
overwhelming
• An option can have a huge impact on CRO Multi cMR
scheduling results DRA -
O erable
Stage nsf
n - tra
a no
h a s ฺ
e r o) uide
n i cฺa ent G
a s o tud
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
De
y
Vija

Under the Hood
• How to enable the different algorithms
– CSP: This is the default solver.

– CRO: Activate with flags on Solver Options and
Resource Properties. There are many modeling
restrictions with CRO,
CRO refer to the user guide
– cMRO: Define Visits
ble
– Multi-Stage Synchronization.
fe r a
• Select the appropriate pre-build policy
ans
• Setup the Resource Relationship Editor n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• There are options that impact the scheduling behavior at different levels
Global Options
Scenario 1 Scenario 2…
ble
fe r a
Resources Routings … Resources Routings … rans
on -t
a n
a s
h deฺ
o )
ฺ a er t Gui
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• Global Settings are accessed via Tools->
Options
• The options typically do not impact the
scheduling algorithms but are general
configuration parameters
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• Most significant options are at the scenario level.
Only the key ones will be covered here.

• Respect Firm Dates in Fixed Time fence
– If checked, then any constraint violations are
ignored
g and work orders are scheduled exactlyy as
specified.
– If unchecked, then solver will try to resolve
conflicts
– Optionally, can respect calendars in the time
ble
fence
fe r a
– Important. Applies to Firm work orders only.
ans
Work orders that are not firm will be pushed
n - t r
outside the fixed time fence o
– The Fixed Time Fence is set at the resource level s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• Build Strategy
– JIT. Right Justified. Will schedule Just-in-Time.

Inventory is kept to a minimum
– Pre-Build. Left Justified. FG held in inventory
ble
fe r a
ans
– If Pre-build is selected,, you
y can select a pre-build
p policyy
p
n - t r
o
• Balanced: Default CSP
s an
• Dynamic Resource Allocation
) h a eฺ
ero t Guid
• Multi-Stage Synchronization
ฺ a
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• Resource Capacity Horizon
– If checked, then all resource capacity and calendar

constraints will be relaxed after the specified number of
days from horizon start.
• This is a very useful option as scheduling is often

concerned with the short term horizon (few
(f days,
1 week) but the horizon is often longer for
visibility purposes => Scheduling to the second is
usually not necessary further out
• In general, shorter Resource Capacity horizons ble
will significantly improve scalability fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• Enable Supply Tolerance Offset
– If checked, then only work orders will be

scheduled, and no PS generated production
recommendations will be created
– Recommended if integrating with ASCP as the
supply and demand balancing will be done by
tactical planning
• More accurately, it can be thought of as
“Schedule Work Orders Only” ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• Unit-of-Effort
– No: Only one routing instance is scheduled, scaled

proportionally. Increases overall make span (6 days in
example).
– Yes: Multiple routing instances are scheduled, allowing for

ble
overlap with reduced total make span (4.5 days in
example):
fe r a
ans
n - t r
o
s an
) h a eฺ
ero t Guid
– Select by Routing: Flag is set on the Routing
ฺ a
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
D
V ijay

Configuration
• Adjacent Operations Preferred
– Checked: Reduce Idle Time by squeezing

operations together
– Unchecked: Idle Time between operation

ble
instances
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• Minimum Cycle Time
– Influences frequency and length of production

runs. Can be set at the resource level as well
• Calculate Ideal Run Sequence
–B
Basedd on C/O cost,
t C/O ti
time, or user-defined
d fi d
ideal sequence; results will vary accordingly
• Minimize Changeovers between Cycles
– Consideration of changeovers across cycle
ble
boundaries, possibly resulting in fairly different
fe r a
schedules
ans
unchecked White Red Black White Red Black
n - t r
o
Cycle 1 Cycle 2
s an
checked White White Red Red
) h a eฺ Black Black
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• Solve Stages
– Allows for different Build Strategies to be

defined by solve stage, or a group of resources
– Includes Campaign Run Optimization but not
the other algorithms
algorithms. This implies that CRO
can be run on multiple stages but this is not
reccomended
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Configuration
• The selection of which algorithm is the most appropriate depends on the characteristics
of the business problem evaluating the strengths and limitations of each.

• Requires careful analysis and extensive proto-typing
Art or Science ?
ble
Which Algorithm s fe r a
n
on
p
and options -totraUse ?
a n
a s
h deฺ
o )
ฺ a er t Gui
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 7a. Impact of solver selection (15 Minutes)
• Open the model for Exercise 7a
a. Solve the model, which is configured for Pre-Build/Balanced

b. Open the combined view Resource/Item Graph. Observations ?
c. Change the solver options to JIT. Repeat step b. Can you explain the difference ?
d. Setup a solve stage
a) Machine 1 and Machine 2 in the first solve stage using Pre-build
b) Testers in the 2nd solve stage using JIT
c) Observations ?
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 7a. Solution
• Walkthrough
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 7b. Impact of solver selection (15 Minutes)
• Open the model for Exercise 7 (note, this is the same as the Vision model included in
the sample data directory)

– This model is configured to use CRO where the INJECTMLD3 is the CRO resources
– Solve the model and analyze the model. In particular, the changeovers on INJECTMLD3
– Duplicate the scenario, turn off CRO from the solver options.
– Solve. What was the impact to INJECTMLD3 ?
– Compare the scenarios and review the KPI’s to understand impact
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 7b. Solution
CRO
ble
fe r a
ans
No CRO
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 7c. Impact of solver selection (30 Minutes)
• Open the model for Exercise 7 (note, this is the same as the Personal Care model
included in the sample data directory)

a. Solve the model
b. Open the combined view Resource Gantt/Item Graph. For Resources, select “Flow”. For Items
select
l t “B
“Bulk
lk WIP It
Items””
c. In the toolbar select the Show Produced Items/Show Consumed Items toolbar
d. Navigate through the Bulk WIP Items, note the inventory graph. Is it well synchronized ?
e. Duplicate the Scenario and change the solver options to JIT. Repeat steps b, c, d
ble
f. Is the JIT Scenario well synchronized ?
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 7c. Solution
Multi-Stage JIT
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Generate a Schedule
Offloading, Repair, and cMRO
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Topic Objectives
– Explain resource and routing offloading behavior

– Modify the schedule using Manual Scheduling and Repair
– Explain how the cMRO algorithm makes decisions
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Offloading
• Resource and routing offloading are key scheduling functions

• The behavior is dependent on the algorithm
CSP CRO Multi-Stage

Multi Stage Dynamic cMRO
Allocation
Work Order • No • Yes, cost based • No • No • No
Alternate
bl e
Routings
fe r a
Resource • Weak • Strong • Strong • Strong
an s
• Weak, same as CSP
Offloading
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Offloading
• Work Order Routing Offloading is only possible with CRO

• Routing offloading is driven by costs (recall, it is an LP based algorithm)
• The cost is based on (Preference x Operation Cost) + Resource Cost. In the example
b l
below, Routing 1 is preferred.
f d
Routing 1 Routing 2
Resource Cost = $20 Resource Cost = $15
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ero t Guid
Operation Cost =$20 Operation Cost =$20
Preference = 1
ฺ a Preference = 2
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Offloading
• Resource Offloading with CRO
– For CRO, the preference is not used. Resource cost dictates the preference (Machine 1 in this case),
all other things being equal
– Keep in mind, other costs are also considered so the resource cost is weighed against missing demand,
inventory carrying costs
costs, and missing safety stock
Resource Cost =$10 Resource Cost =$20

Preference = 2 Preference = 1
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Offloading
• Resource Offloading with CSP
– CSP offloading is rule based. Initial resource selection purely based on preference (machine with green
highlighting)
ble
S>E
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Offloading
– For each operation to be scheduled to meet a given demand, utilization of the primary resource is
calculated from start of the horizon to the end of that operation.
– If the calculated utilization exceeds Machine 1’s Offload Threshold %, it will offload to Machine 2. In
the given example
example, 85% is never exceeded
exceeded, thus the primary resource is always chosen
ble
fe r a
ans
n - t r
o
s an Calculate Utilization
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Offloading
– Pre-build Target is used to reduce the period that serves as basis for the utilization calculation and
increases the likelihood for exceeding the Offload Threshold %, thus offloading more frequently.
– This can result in reduced make span, but may come at a cost via possibly increased changeovers.
ble
fe r a
ans
n - t r
Calculate
l l
o
Utilization
l
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Repair
• After creating an initial schedule, refinement will be required as it is unrealistic to
expect to schedule to be perfect

• Scheduling refinement can be made by:
– Drag and drop in the Resource Gantt
– Re-sequencing in the Resource Sequence view
– Dynamic data changes (i.e. on-hand, supplies, demands)
• After making changes it is necessary to “Repair” the schedule. There are 2 modes of e
l
Repair rab e
– Constrained
a n sf
– Unconstrained (recently introduced in 12
12.2.4)
2 4) n - tr
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Repair
• Constrained Repair • Unconstrained Repair

– Will respect the constraints that you have – Attempts to respect the user decisions only
modeled – Constraints can be violated
– 1 change can, and will often trigger many other – Exceptions given for constraints that are violated
changes
– 3 modes
– Changes may not take due to violation of a
• Single Stage
constraint
• Multi-Stage
– Limited feedback • Multi-Stage with Related Work Orders
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Repair
• Unconstrained Repair
– Can be enabled on the toolbar

– Can be set to the default on the Global Options
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Repair
• Unconstrained Repair
– Single Stage: Will not propagate changes to

other related operations in a multi-operation
work order. Can lead to precedence constraint
violations
– Multi-Stage: Will move other operations on
the work order to minimize work order
makespan
– Multi-Stage included Related Work Orders:
ble
Similar to Multi-Stage but will also move
fe r a
Related Work Orders to minimize makespan
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

cMRO
• When scheduling Visits, resource contention will be resolved in the following priority
1. Min { Milestone target completion date, WO target completion date}

2. Visit request date
3. Visit priority class
4. Visit priority ble
fe r a
5. Work order order class
ans
6 Work order priority
6. n - t r
o
7. Work order request date s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
D
V ijay

Exercise 8. Offloading with the base CSP solver (15 minutes)
• Open the model for Exercise 8
a. Examine the Routing. What are the alternate resources ?

b. Solve the model. Did it offload ? Can you explain ?
c. Change the availability of the resource by changing the calendar (Resource Properties->Availability
tab.
b Change
h calendar
l d to Default-Machine1)
f l h )
d. Solve the model. Did it offload ?
e. Set the Pre-Build target to 7 days (Resource properties-> Solver Options tab)
f. Solve the model. Did it offload ?
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Walkthrough
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 9. Offloading resources with CRO (15 minutes)
• Open the model for Exercise 9
a. Examine the Routing, in particular Operation 10.

a) What are the Alternates ?
b) Which is the primary resource ?
c)) What
h are theh CRO resources in the
h model
d l?
b. Before you solve, which resource do you think Operation 10 will schedule on ?
a) Solve. Obervations ?
b) Configure the routing so that it chooses the other alternate machine not selected in the step above.
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Walkthrough
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Solution Architecture and Best Practices

Introduction
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Topic Objectives
– Identify scheduling problems that are ideal for Production Scheduling

– Avoid common traps and missteps in an implementation
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Introduction
• Production Scheduling is a flexible application that requires careful modeling and
configuration to get the desired results

• The simple presence of a BOM, Routing, (or Recipe, Formula) and Demand does not
mean that it is a good fit for Production Scheduling.
Will Production
Scheduling solve my
scheduling problem ?
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Introduction
• Every manufacturing environment presents unique challenges
– Make to Stock, Make to Order, Engineer to Order, Mixed Mode, Lean/Kanban, Configure to Order,
Assemble to Order, Cell Design, Work Center/Job Shop
– Discrete vs. Process
– Maintenance vs. Manufacturing
f
• Business and practical objectives play a key role
– Customer service objectives
– Inventory objectives ble
fe r a
– Manufacturing, labor, and capital costs
ans
– Engineering or efficiency considerations
n - t r
o
– Rule of thumb/tribal knowledge
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Problem Qualification
Problem Characteristic Capability in Production Scheduling Level of Support
Discrete lot-based manufacturing • Originally designed for discrete based modeling and engine Good
Multi-Stage Manufacturing Process • Various precedence and temporal relationships available in routings Good
and via related work orders.
• Inventory relationships between stages available, though
synchronization has room for improvement.
Batch Resources • Batch resources are well supported within Production Scheduling. Partial
Challenge will be in integration where work orders cannot be split
ble
across batches
• Strong resource offloading logic in specific algorithms such as fe r a
Alternate resource selection
Campaign Run Optimization, Dynamic Resource Allocation, Multi-Stage
Good
an s
Synchronization
n - t r
Alternate Routings
a no Partial
• Alternate routings can be modeled using Campaign Run Optimization
h a s ฺ
e r )
o**Not u ideto be a comprehensive list
cฺa ent G
intended
n i
o tud
s
a
an his S
p
@ se t
e p
y ฺ de to u
( v ija nse
e p l i c e
D e
y
Vija

Shelf Life • Not directly supported in the application Low

• Can be mitigated by clever modeling to minimize the consumption
time of shelf life sensitive products
Limited Storage capability of WIP • Not supported as a constraint in the application Low
and Finished Goods • Maximum levels can be modeled for reporting and exception purposes
only
Batch Resources • Batch resources are well supported within Production Scheduling. Partial
Challenge will be in integration where work orders cannot be split
across batches
ble
Continuous, rate-based, production • Always consumes all inventory at the beginning of an operation, and Partial
fe r a
with steady inventory release and releases the produced items at the end of the operation.
an s
consumption. • Discrete approximation possible via reduced lot multiples. Risks are
n - t r
no Low
increased number of operation instances and solve time impacts
impacts.
Complex material constraints a
• Material planning is not a strength of production scheduling
s ฺ
considering Engineering Changes,
h a
• Material planning is left to tactical planning (ASCP) with guidance
ideto be a comprehensive list

) intended
alternate selection, use-up passed to scheduling via work orders and planned orders
effectivity
e r o**Not u
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
D e
y
Vija


Deep complex BOM’s and • Difficult to control the ability to converge subassemblies Low
subassemblies that need to be simultaneously
synchronized tightly
P j b
Project based
d environments
i • Supports
S reservations
i which
hi h may b
be used d to reserve specific
ifi project
j L
Low
based supply to demand but project id is not carried through.
Scheduling for EAM • No support for counters, cycles so scheduling of EAM work orders is None
not possible.
• EAM Work Orders can be imported and PS can schedule around them
but just for visibility purposes. ble
• Can represent coming out of an operation, but cannot prevent fe r a
Co-Products/By-Products
production from being instantiated to satisfy demand . i.e. do not
Partial
an s
create production if there is demand, only use on hand
n - t r
Maintenance, Repair and Overhaul
a no Good
• Integration with cMRO including work breakdown structure,
schedules milestones, critical path
h a s ฺ
e r u ideto be a comprehensive list
) intended
o**Not
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
D e
y
Vija


Synchronous Make-Pack • The addition of multi-stage synchronization was targeted at customers Partial
environments with certain ‘flavors’ of make-pack
• The characteristics of these environments vary and not all
g
configurations are supported
pp
Lot tracking environments • Production Scheduling does not support lots None
Continuous real time updates and • Designed to run once a day leveraging existing collections None
scheduling infrastructure
• No integration to MES
• Latency on running and end to end process
ble
• No incremental updates
fe r a
• Continuous collections is possible to reduce latency but latency will still
an s
be high
n - t r
a no
h a s ฺ
e r u ideto be a comprehensive list
) intended
o**Not
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
D e
y
Vija


Scheduling of Tanks • Data model representation and algorithm capabilities do not allow None
addressing these scheduling problem characteristics in satisfactory
manner
Rate-matching between successive • There is no rate matching capability None

manufacturing stages to ensure fully
synchronous WIP
production/consumption.
Cleanups based on actual resource • Changeovers based on time/usage (cleanup after 30 days, 1000 hours None ble
usage etc)
fe r a
Maximum Run Time • Maximum run time of a production run None
ans
n - t r
n o
Crew Instance Scheduling a
s ฺ None
• Will schedule crew capacity, but not specific crews (i.e. named
resources).
h a
e r ) intended
o**Not u ideto be a comprehensive list
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
y De
V ija

• When qualifying a problem, even though most of the problem characteristics may be
well handled by the application it only takes a single missing piece of functionality to
cause problems
• “Almost” is not good enough for scheduling
• Proper qualification must use proto-typing to
validate the expected behavior
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Thought Exercise (20 min)
• Will Production Scheduling be a good fit ?
– You manufacture personal care products in an MTS environment: Shampoo, conditioner, lotion, tooth
paste, etc.
– Manufacturing process:
• Fi
First,
t various
i iingredients
di t are mixed
i d iin ttanks
k off diff
differentt sizes.
i All ttanks
k are alternates
lt t tto one another.
th
• After a QA ‘quarantine’ time, the WIP product is converted into finished goods on various packaging lines.
Different package types, sizes, and labeling is relevant.
• Limited inventory buffer between the stages.
ble
fe r a
ans
• Which issues can be expected, if any? n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Frequently Asked Questions
1. Are there any workarounds for modeling Tanks ? Storage Constraints ?
2. The customer has an existing scheduling solution, will Production Scheduling be a

good fit ?
3 If I roll out Production Scheduling in 1 plant
3. plant, will it work in other plants ?
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Guiding principles
– Generating a quality schedule requires

• Quality Data
• Intelligent modeling
• Business process that
h supporting working
k with
h the
h schedule
h d l
– Just because you can run MRP, ASCP, or other planning processes does not mean you can create a
quality schedule
– Blindly generating and launching a PS model using the stock integration will never generate a quality e
schedule
r a bl
s fe
- t r an
on
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Guiding principles
– Don’t try to model everything, especially initially. i.e. Focus on a single, bottleneck stage first. Layer
other constraints later
– Almost all successful implementations will require some level of customization
– You should
h ld never expect a perfect
f schedule.
h d l Aim ffor 70-80% with h supporting processes to get you theh
rest of the way
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Time Horizon
• Typically 18+ Months

• Align Finance and Operational Goals
S&OP • Demand Shaping, New Product Introductions
• ~6 months
• Support tactical decision making consistent with the guide posts established from the
ASCP S&OP process
ble
fe r a
ans
• ~1
1 month
n - t r
o
an
• Short time horizon
PS
h s
a eฺ
)
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Time Horizon
– Keep the scheduling time horizon as short as possible

• Schedules are created with accuracy to the second. Is this level of accuracy required beyond a few days, a
week, a couple weeks ?
• For visibility and continuity purposes,
purposes the horizon is often > than what is required for true scheduling
– Consider using the Resource Capacity Horizon beyond what is necessary for Scheduling
• Fixed Time Fence

– Can be Set at the resource level but keep it consistent across resources
ble
– Many factors involved. Tradeoff between flexibility and schedule stability
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Items
– Some manufacturing environments require hundreds or thousands of items

– Only include items that you want to control your schedule
– In an integrated environment, using Category Sets in the PS plan options to filter non-critical items
– Leave the material planning up to ASCP
– Materials can also be ‘relaxed’. This is strongly recommended for items that are included in the plan
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Resources
– Only model scheduling relevant resources

– Relax non-constraining resources
– Leverage the Resource Capacity Horizon
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Routings
– Quality Routings are the crux of generating a reasonable schedule

– A routing that is suitable for accounting, tactical planning, or MRP may not be suitable for scheduling
– A routing Re-Engineering effort is not uncommon
– The number and size of the operation instances is directly related to the Lot-Multiple.
• More operations means longer solve times. When determining the appropriate value it is a balance
between flexibility and performance
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Routing Precedence constraints
– Not all precedence constraints are created equal

– Some off a lot more flexibility than other
• Start After End vs. Start At End
• An inflexible precedence constraint is
– Any one that has an “At” in it (Start At End, Start At Start…)
– If you have a Max separation defined
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Thought Exercise
– What will happen if you try to schedule the following Routings ?

– Assume each operation relationship is Starts After End. i.e. Operation 20 must start IMMEDIATELY
after Operation 10, Operation 30 must start immediately after Operation 20 etc.
R1 10 R1 10
R2 20 R2 20 40
ble
R3 30 R3 30
fe r a
ans
R1 10 R1 10
n - t r
no
R2 20 40 R2 20 40
R3 30
a
s ฺ
R3 30
h a
e r o) uide
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
De
y
Vija

Thought Exercise
– There are 4! = 24 Possible combinations (3 examples shown below). Regardless, each will have:
• Major gaps in the schedule (poor resource utilization)
• Poor on-time performance
R1 10 10 10 10
R2 2 40 20 40 20 20 40
0
R3 30 30 30 30
ble
R1 10 10 10 10
fe r a
R2 20 40 20 2 40 20 40
an s
r
0
R3 30 30 30 30
n - t
o
an
R1 10 10 10 10
s
R2 20 20 40 40 20 2 40
a eฺ
0
h
R3 30 30 30 30
)
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Thought Exercise
– Assume more flexibility. Starts After End (Operation 20 can start anytime after Operation 10)
• Better Resource Utilization
• Better ability to meet demand
R1 10 10 10 10
ble
fe r a
R2 20 20 40 20 20 40 40
ans
n - t r
R3
3 30 30 30 30
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Thought Exercise
– Tight precedence constraints would be like playing 2 game of Tetris simultaneously where the
movements of both have to be the same.
Which is easier ?
Vs.
ble
fe r a
ans
n - t r
– Do not use tight precedence constraints or Maximum separations if you can avoid it! o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Calendars
– There are 2 types of calendars, Delay and Down calendars. Recall

• Delay: Operations can be interrupted and can continue afterwards (Default)
• Down: Operations cannot be interrupted. Once started, it has to complete.
– What are the implications of using a Down Calendar vs. Delay Calendar ?
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 10. Impact of Down vs Delay calendars (30 minutes)
• Open the model Exercise 10-1.xml. (Note, this is the same as the Semi-Conductor model
in the sample data directory).

a. Solve the model.
b. Identify the bottleneck resource and view the resource utilization Gantt. Is it fully utilized ?
c. Open model Exercise 10-2.xml. This is the same model except with Down calendars.
d. Solve the model from c. What is the bottleneck resource ? Is it fully utilized ?
e. Compare the resource utilization of both models. Which has more idle time ? Why ?
f. Compare the KPI’s of both scenarios, which has the better customer service ? ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 10. Impact of Down vs Delay calendars (30 minutes)
• Walkthrough
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Calendars
– Delay calendars provide much more flexibility and, in general, better quality solutions
– Down calendars are inflexible. In the example below in the ~45 minute gap, only an operation of 45
minutes or less can be scheduled here.
ble
– Used Delay calendars unless Down calendars are absolutely necessary. fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Work Orders
– The size of a work order will have a big impact on the schedule quality
– Smaller work order sizes provide more flexibility to the application, larger work order sizes are difficult
to schedule
– Using the
h Tetris analogy,
l smaller
ll bbite sized
d pieces are easier to manage
Which is easier ?
ble
Vs.
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Thought Exercise (15 min)
• Work Orders
– Consider a Bike Manufacturer where frames must go through an Annealing Oven to harden the frames
• Annealing Oven is the Bottleneck
ble
fe r a
ans
n - t r
n o
Welding Annealing (Frames) Painting a
s Assembly
) h a e ฺ
o
er t Gu i d
ฺ a
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Thought Exercise
• Work Orders
– 2 Bikes are sold. 29” and 26”

• Identical other than the size so they have same Annealing temperature and time (1100 F for 2 hrs)
– 2 Annealing Ovens with the following capabilities

• Annealing Oven 1, Capacity = 5. Can only process 26” Frames and smaller
• Annealing Oven 2, Capacity = 10. Can process 29” Bikes and smaller
ble
– A Hot Order is received for 10 26” Bikes and 5 29” Bikes. They both need to go out ASAP fe r a
• 2 High Priority Work Orders are created to Make 29” (Qty 5) and 26” (Qty 10)Bikes ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Thought Exercise
• Work Orders
Annealing Oven 1
• 5 ‘Spots’ on the Rack to
hang a frame
• Can only process 26”
Frames or smaller due to
size limitation
Annealing Oven 2
ble
• 10 ‘Spots’ on the Rack to
hang a frame
fe r a
• Can process 29” Frames
(or smaller) due to larger
ans
size
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Thought Exercise
• Work Orders
– How would you schedule the work orders for 10 26” Bikes and 5 29” Bikes
Schedule 1 Schedule 2
ble
fe r a
Schedule 3
ans
n - t r
o
s an
) h a eฺ
eo tG
Recall 10 26” Bikes and 5 29” Bikes. 29” Bikes must gorthrough
ฺ a ud 2
AnnealiOven
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Thought Exercise
• Work Orders
– Schedule 1 is not achievable with current work order structure since…
Schedule 1
Work Order 1 is split across 2

resources concurrently
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Work Orders
– Work orders are inflexible

• Once created, work order cannot be split
• A work order operation activity can only run on 1 selected alternate
– Conclusion
• Keep work order quantities as small as possible
• Release work orders on a Just-In-Time basis to keep the flexibility
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Managing constraints
– Touched upon in different sections, worth revisiting since it is a critical consideration

– For any constraint based solver
• The more constraints, the harder it will be to solve
• Limits the scalability
• Solution quality will usually be poor
– Focus on key constraints that you want to dictate the schedule only
• Don’t model everything
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
– Resources
• Relax non-critical resources, focus on bottlenecks
• Leverage the resource capacity horizon
– Items
• Consider items that are critical for scheduling only, materials should be planned in tactical planning (ASCP)
• Filter out items using Category Sets
• Relax items if you feel the need for visibility in the scheduling application
ble
– Calendars
fe r a
• Down calendars are very restrictive, use Delay calendars
ans
– Precedence constraints n - t r
o
an
• Do not use restrictive precedence constraints if at all possible. If using restrictive precedence constraints,
s
relax the downstream/upstream resource
) h a eฺ
• Do not use Maximum separation
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
– Scheduling Horizon
• Keep the scheduling horizon as short as possible
• Leverage the Fixed Time Fence and Firm Dates
– Manual Scheduling
• Use unconstrained manual scheduling
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Material Planning
– PS can model suppliers, lead-time, purchase orders

– Alternate items
• It does not consider
– Order modifiers
– Material constraints beyond lead times
– Effectivity dates
ble
– Price discount and supplier preferences
fe r a
• The material modeling is only intended as a guidance for scheduling ans
n - t r
– Do
D not use iit ffor material
i l planning
l i o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Best Practices
• Validate your assumptions
– Prototype
– Prototype
– Prototype
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Deployment Architecture and Technical

Considerations ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Topic Objectives
– Identify the different deployment options and the pros and cons for each
– Work with the Production Scheduling data model
– How to approach customizing the application
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija


Considerations ble
Data Model and Customizations fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Data Model
• The PS model can be persisted in 2 different formats – XML and .dxt
ble
fe r a
ns
.dxt
-tra
• .dxt is a binary format that is not compatible across versions and patch levels
on
n
– Main advantage is ability to save the model in a ‘solved’ state
a
a s
h deฺ
o )
ฺ a er t Gui
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Data Model
• Understanding the XML data model is necessary if you want to extend or customize the
PS model
– View in any xml editor, there are many free ones available (i.e. XML Notepad)
– The data model is stored in objects
– Any model data that is required is stored here
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 11. Explore the PS XML Data Model (30 min)
• Download and install a free xml editor if you don’t already have one
• Open Exercise 10-1.xml in the XML editor

• Open Exercise 10-1.xml in PS as well
• Compare the
h MachineList
h in the
h xmll with
h the
h Machines
h in the
h PS UI
• In the PS UI, open the properties of Machine ‘FAB’
– What is the capacity of the machine ?
ble
– Can you find this property in the XML ?
fe r a
– Change the capacity of FAB to 999 in the xml and save
ans
– Re-open
p the modified XML model in the PS,, did the capacity
p y of FAB change
g ?
n - t r
n changeovers to
• In the XML, find where changeovers are defined. Change all 10aminute
o
15 minutes and verify in the UI ha s ฺ
e r o) uide
n i cฺa ent G
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
D e
y
Vija

Exercise 11. Explore the PS XML Data Model (30 min)
• Basic objects (Items, Machines, Crews, changeovers etc) are pretty simple since the
object definition is pretty flat

• In the same model, navigate to the first operation defined in the XML. Explore the
hierarchy of the XML definition and compare it to the UI.
– Change the rate of Die Bonder 1 to 45 minutes
– Save and re-Import in the application and validate
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 12. Customize a PS XML model (60 Min)
• Attributes are the most common customization. Customize the Exercise 12.xml
manually in your XML editor. Add the following to the XML

– Attribute = Color. Values (Red, Green, Blue)
– Changeover Matrix for Paint Resources
From To Time
Green Blue 3 hrs
Blue Red 2 hrs
Red Any other color 5 hrs
bl e
Any color Any color 4 hrs
r
fe to
• Hint: refer to the previous exercises as hints and don’t forget to assign attributes and attribute values
a
n s
the operations, resources and Items.
– Once n - tra
no
O solved,
l d your model d l should
h ld llookk something
thi lik
like thi
this:
s ฺ a
h a
e r o) uide
n i cฺa ent G
a s o tud
p an his S
e p @ se t
y ฺ de to u
( v ija nse
e p l i c e
y De
Vija

Customization Demo
• Demonstration
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Data Model
• To customize a PS model you modify the input PS XML
• Any data element can be modified, added, deleted using standard XML manipulation
– All modern scripting and programming languages can be used (Python, PERL, Java,, etc….)
– Tip: Use an event based XML parser (i.e. Sax) vs. Tree based parser for scalability purposes
• References
– Search Google/Amazon!
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Common Data Model Customizations
• Attributes
– The attribute framework in Production Scheduling is central to the data model and core to the
scheduling problem
– Attributes are used for:
• S h d li lik
Scheduling like jjobs
b ttogether
th
• Defining Changeovers
• Defining Batching attributes (i.e. temperature, duration)
• Ideal Sequence
ble
• Operation Highlighting
fe r a
• Operation Renaming to make them more understandable
t r a ns
– Limited attributes come over in the standard integration
g - need to
and most implementations
p
o n
an
supplement the standard integrated model with additional attributes.
h s
a eฺ
)
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
D
V ijay

• Precedence Constraints
– Production Scheduling supports the following precedence constraints

• Starts After End (with Min/Max Separation)
• Starts At End
• Starts After
f Start ((withh Min/Max
/ Separation))
• Starts At Start
• Ends At End
– The standard integration defaults this to Starts After End since it is not possible to define this in more
ble
detail at the source
fe r a
– The exception to this is when MSO: Enforce Resource Sequence Contiguity is set in which case
ans
Precedence Constraints are set to S@E for Resource Sequences WITHIN an operation
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Precedence Constraints ACROSS work orders
– Related Work Orders

– Only possible with cMRO models
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Consistent Resource Assignment
– Property of a routing
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Calendar Type
– By Default all calendar events are Delay calendars
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

• Reservations
– Production Scheduling supports reservations for all Supply and Demand Types
– The following reservations are supported in our standard integration
• On-Hand to Sales Order
• On-Hand to Work Orders
• Work Orders to Work Orders
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija


Considerations ble
Deployment and Architecture fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Deployment Options
• There are generally 4 deployment options
1. EBS Standard Integration

• Option when they have an EBS source system
• Plant to use other VCP products
2. VCP Server with Legacy collections
• Option when they wish to deploy the VCP infrastructure
• Plan to use other VCP Products
3. VCP Server leveraging the JDE PIP
ble
• When they have a JDE E1 source system
fe r a
• Plan to use other VCP Products
ans
4
4. ‘Standalone’
Standalone deployment n - t r
o
• PS standalone installation
s an
• Custom integration from source system
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
• The architecture follows the same infrastructure for all approaches with the exception
of a “Standalone” deployment
Value Chain Planning
• Firm Planned Orders
cMRO Discrete
ASCP
e
• Planned Orders
bl
• Transfers
•
a
Forecast
• Sales Orders
fe r
OPM
Operational Data Store
an s
JDE
n - t r
o
an
• Scheduled Work Orders
• Release Planned Orders
s PS
) h a eฺ
ero t Guid
Legacy OSFM
ฺ a
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
• Standalone Integration Architecture.
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
1. Defining a Plan Name and profile options

2. Collections
 Collections populates the ODS database which is the data store used for VCP Planning applications.
The data all VCP Modules is extracted from the ODS data store.
3. ODS Data store.
 This data store contains the collected data that is used by all VCP applications.
4. PS Snapshot
a b le
 The can be triggered through the UI and snapshots the data from ODS based on the plan f r
eoptions
n s
parameters and application specific logic. The output of this file is a series of XMLafiles
- t r
n on
s a
) a
h deฺ
o
er t Gui
ฺ a
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
5. Extracted Planning Data (XML).

 The launch process extracts data from the ODS into a series of XML files.
 The files are stored in the location determined by the profile option: MSC: PS/SNO Data Store
Path
 For instance if the above profile option has a value of:
/SLOTS/slot03/appmgr/MA2CT102comn/admin
 The XML files will be stored in the directory:
/SLOTS/slot03/appmgr/MA2CT102comn/admin/<plan_id>/refresh/src ble
fe r a
 Plan_id is the numeric key associated with the plan name. To determine the plan-id, the user
ans
can query MSC_PLANS table as follows:
n - t r
o
SELECT PLAN_ID FROM MSC_PLAN
s an
WHERE COMPILE_DESIGNATOR=’<plan_name>’;
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
 XML Output is the result of this process
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
6. Pre-Connector Script.
 The Pre Connector script is an OPTIONAL script, which allows for integration extensions to the
XML data files or any other processes scripts which you may want to call at this time.
 The scripts
p are kept
p in the directoryy <Data Store Path>/<plan
/ p id>/script.
/ p
 If you want to do integration extensions, you will need to create this directory AFTER first
defining the plan AND launching the plan for the first time.
ble
 The script file is called "pre_con.sh" on Unix/Linux systems and "pre_con.bat" on windows
fe r a
machines.
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
7. Model Generation Connector.

 The connector will run and converts the extracted XML files into a Production Scheduling XML
file called EbiPSModel.xml
 The file is located in the followingg path:
p
 <Data Store Path>/<plan id>/refresh/target/
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
8. Post-Connector Script.
 The Post Connector script is an OPTIONAL script, which allows integration extensions to the
Production Scheduling XML file
 Kept
p in the directoryy <Data Store Path>/script.
/ p If yyou want to do integration
g extensions,, you
y
will need to create this directory AFTER first defining the plan AND launching the plan for the
first time.
 The script file is called "post_con.sh" on Unix/Linux systems and "post_con.bat" on windows
machines.
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
9. PS Batch Engine.
 The PS batch engine reads the PS.xml and optionally solves the model on the server
 The PS model is saved and can be found in the path <Data Store Path>/<plan
id>/refresh/target/
/ / g / EbiPSModel.xml or EbiPSSolved.dxt if it is solved on the server
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
10. Download Plan. This is a user step that downloads the model file to the client and launches the PS
Application and loads the model from the server
 Note: If the client does not Production Scheduling installed, or a more recent version is
available, the system will prompt you to up-date the client software.
 The model be downloaded the system copies the model file from the target directory on the
server to the client PC. By default this is saved to the
<CLIENT_INSTALL_PATH>/scp/data_store/<plan_id> folder.
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
11. Publish Process. The publication is a two-step process:

 Create the flat files containing the schedule information
 Run the post publish script that transfers the flat files from the client to server and then
updates
p the ODS Data store.
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Architecture
• Standalone Integration Architecture

Approach follows the same general
flow
1. Extract data from 1 or more source
1 systems
Source
2 2. Convert the extracts using an ETL or
3 other mechanism to a compliant PS
XML model
3. Load and solve in PS
ble
r a
4. Publish from PS (either XML or CSV)
fe
5 4
ans
5. Load results back to the Source
t r
System using ETL, available API’s or
n -
other
th mechanisms
h i o
Source
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija


Considerations ble
Performance and Sizing fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Performance
• Performance is impacted by many factors
– Number of operations
• Factors: Lot multiples, time horizon, unit-of-effort, number of demands
– Time horizon
• Factors: Keep as short as possible, Fixed Time Fence, Resource Capacity Horizon
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Performance
• Performance is impacted by many factors
– Number of constraints
• Factors: Number of Resources, precedence constraints, number of items, down calendars, relaxed
constraints (resource capacity horizon, relax materials, non-critical resources)
• Analogy,
Analogy scheduling a meeting with 7 people vs vs. 3 people
people…which
which is easier ?
ble
fe r a
ans
– KEEP IT SIMPLE
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Sizing
• Work with the Oracle account manager for appropriate sizing recommendations
– Sizing for all tiers including middle tier, database, application server
• For the PS Application some general rules of thumb can be used
– Budget nn+1 1 cores where n n=## of PS models and 1 is for OS processes
– PS is CPU Bound, get the fastest processor available
– Supports Windows, Unix, Linux
– 32-bit until 12.1.3, 64-bit only 12.2.4 onwards)
ble
– Best way to size is to run a proto-type although the scaling is non-linear
fe r a
– Memory, 2GB per model is a good rule of thumb
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija


Considerations ble
Publishing, Technical Need-to-Know fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
i Q and sA slide
( v
e n
e ep lic
y D
Vi j a

Publishing
• Approved schedules can be published
• 4 Pre-configured publish profiles

– Release Schedule is for the standard
integration
– Releases work order schedule to EBS leveraging
the WIP mass load API
• You can add custom profiles to extract
data in XML or CSV format ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Publishing
• Custom publish profiles can be added.
Most often used for reporting

• Granular Data selection is avaiable
• You can specify a script to be called after
publishing to enable workflow
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Batch Utility
• For users not leveraging standard integration, the PSBatch executable can be invoked to
create and solve the PS model in batch.

– Command Line: PSBatch <BatchXML>
– Sample input xml contents (MyBatchScenarios.xml sample included in sample_data directory)
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Connector
• Utility that converts extracted XML files to a PS XML Model
• How to run:
– % ps::model refresh <MODEL_GENERATION_CONFIG> <XML_INPUT_DIR> <XML_OUTPUT_DIR>-
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Logging
• Log window and log file (see Tools|Options) contain
relevant information
• 3 Types of logs:
– Event Log. Basic Data validation
– Progress log
log. Application progress and solver statistics
summary
– Solver Statistics. More details solver statistics
• At beginning of a solve, additional validation takes
place
ble
– CRO resources and their usage in overall process (cyclical?)
fe r a
– Lot multiples defined?
ans
– Durations defined?
n - t r
o
• Not all issues are caught, leading possibly to
s an
unexpected results, or solver terminations
) h a eฺ
ฺ a ero t Guid
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 13. Publishing data (15 minutes)
• Open the model for Exercise 7b
• Create a custom Publish profile to export data in

– CSV Format
– XML Format
• Solve and approve the schedule
• Publish both publish profiles that you created, examine the data files and data.
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 14. Batch Utility (15 Minutes)
• Open a command prompt and start the Batch utility covered in this section
• Run the utility using the sample batch xml (MyBatchScenarios.xml in the sample_data
directory)
• Open the resulting model ((.dxt
dxt file)
• Modify the MyBatchScenarios.xml to import and solve a different model of your choice
• Open the resulting model (.dxt file)
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Exercise 15. Logging (30 Minutes)
• Open EXERCISE.xml
– Identify and manually correct the data problems in XML until you can load the model with no errors
ble
fe r a
ans
n - t r
o
s an
) h a eฺ
ฺ a ero t Guid
s o nic den
a n a S tu
p thi s
e p @ s e
e
ฺd e to u
j a y
p (vi icens
ee l
y D
Vija

Vija
Dy
ee p
j a
l
y
e
(vi icens
e p @
ฺd e to u
a
s
n
e
a s
p thi
o
s S
ฺ a
tu
)
nic den
h s
ero t Guid
a eฺ
an
on - t r an
s
fe r a bl
e

Production Scheduling PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Production Scheduling PDF

Uploaded by

Copyright:

Available Formats

Unauthorized reproduction or distribution prohibitedฺ Copyright© 2017, Oracle and/or its affiliatesฺ

Learn more from Oracle University at oracle.com/education/

Restricted Rights Notice

U.S. GOVERNMENT RIGHTS

I Implement VCP Production Scheduling I-2

y D Repair, and Overhaul 2-79

Vi j a Production Scheduling Fundamentals 2-80

3 Generating a Schedule Introduction

4 Solution Architecture and Best Practices Introduction

5 Deployment Architecture and Technical Considerations

Deployment Architecture and Technical Considerations

Oracle Value Chain Planning: Implement Production Scheduling 1

Implement VCP Production Scheduling

Oracle Value Chain Planning: Implement Production Scheduling 2

Oracle Value Chain Planning: Implement Production Scheduling 3

Oracle Value Chain Planning: Implement Production Scheduling 4

Oracle Value Chain Planning: Implement Production Scheduling 5

4 Solution Architecture and Best Practices

Oracle Value Chain Planning: Implement Production Scheduling 6

Oracle Value Chain Planning: Implement Production Scheduling 1

Customer Service Analysis

Oracle Value Chain Planning: Implement Production Scheduling 2

Increased Customer Expectations Customer Service High service levels required

Product Proliferation Planning Impact on inventory and WIP

Lower Customer Service

Oracle Value Chain Planning: Implement Production Scheduling 3

• Single source of truth

Scenario Planning & Analytics

Oracle Value Chain Planning: Implement Production Scheduling 4

• Single source of truth Risk Event

Oracle Value Chain Planning: Implement Production Scheduling 5

• Answer the tough questions

Oracle Value Chain Planning: Implement Production Scheduling 6

• Advanced Supply Chain Planner

Oracle Value Chain Planning: Implement Production Scheduling 7

Oracle Value Chain Planning: Implement Production Scheduling 8

• Maximize throughput of bottleneck resources

Oracle Value Chain Planning: Implement Production Scheduling 9

Production Scheduling Fundamentals

Oracle Value Chain Planning: Implement Production Scheduling 1

– Access and use the following editors

Oracle Value Chain Planning: Implement Production Scheduling 2

Oracle Value Chain Planning: Implement Production Scheduling 3

Oracle Value Chain Planning: Implement Production Scheduling 4

• Demands: Customer orders, forecast, safety

• Data can be added, edited, deleted for simulation

Oracle Value Chain Planning: Implement Production Scheduling 5

Oracle Value Chain Planning: Implement Production Scheduling 6

• Only relevant in multi-stage synchronization

Oracle Value Chain Planning: Implement Production Scheduling 7

• Most common Editor used

• Planned Orders from ASCP arrive as ‘Work Orders’

Oracle Value Chain Planning: Implement Production Scheduling 8

• The work order header has basic information such

• Within each Order class you can have 5 priorities

Oracle Value Chain Planning: Implement Production Scheduling 9

• The work order details has the information you

Oracle Value Chain Planning: Implement Production Scheduling 10

the model such as

Oracle Value Chain Planning: Implement Production Scheduling 11

behavior including algorithm selection

Oracle Value Chain Planning: Implement Production Scheduling 12

Production Scheduling Fundamentals