SATUAN ACARA PERKULIAHAN (SAP)

MATA KULIAH: METODE KUANTITATIF

KODE / SKS

: SI - 601 / 3 SKS

PROGRAM STUDI

: MAGISTER MANAJEMEN

Pertemuan

Pokok Bahasan

Tujuan Instruksi Umum

Sub Pokok Bahasan

Sasaran Belajar

(TIU)
I

- Pengenalan Penelitian

- Mahasiswa dapat mengetahui - Definisi penelitian

apa yang dimaskud dengan - Definisi ruannng lingkup
penelitian, penelitian di
bidang bisnis

I & II

- Introduction
- Linear Programming

III

- Transportation Problems

penelitian bisnis

- Tipe-tipe penelitian bisnis

Memberikan Pemahaman - Introduction

kepada mahasiswa tentang - LP Formulation and
metode penyelesaian
Assumptions
masalah secara kuantitatif - Solving Minimization and
Memebrikan PEmahaman
Maximization Problems
kepada Mahasiswa agar
- LP Applications
mereka mampu
Formulation
merumuskan secara
An
Overview of the Simplex
matematis dari suatu
Method
masalah yang bersifat linear
serta mampu mencari solusi - Simplex Solution of The
Product Mix Problem
optimal dengan
- Adapting to the Other LP
menggunakan linear
programming
forms
- ASensitivity Analysis
- The Dual L
Memberikan Pemahaman
- A Production / Distribution
kepada Mahasiswa tentang
Problem
beberapa metode penyelesaian - The Transportation Algorithm

- Mahasiswa mampu
-

menjelaskan definisi
penelitian
Mahasiswa mampu
menjelaskan definisi dan
rang lingkup penelitian bisnis
Mahasiswa dapat memahami,
memformulasikan LP dengan
asumsi-asumsi yang ada
Mahasiswadapat
menyelesaikan maalah LP
baik untuk mimasi maupun
maksimasi dengan
menggunakan metode grafik,
serta dapat memanfaatkannya
untuk sejumlah aplikasi
Mahasiswa dapat memehami
metode simplex, dapat
menggunakannya untuk
menyelesaikan masalahmasalah LP dan dapat
melakukan analisa sensitivitas

- Mahasiswa dapat memahami

masalah Produksi dan
Distribusi serta algoritma

masalah transportasi
- Assigenment Problems

- Special Situation
- The Assignment Problem
kepada Mahasiswa tentang
- The Assignment Method
metode penyelesaian masalah
- A Summary of The General
Penugasan

- Memberikan pemahaman

Procedure

IV

Inventory Models

- Memberikan pemahaman
kepada Mahasiswa tentang
Inventory Models

- Nature and Function of

Inventories

- Economic Order Quantity

Model

- The Total Cost Equation

- Computing The EOQ
Mathematically

- Sensitivity Analysis
- Nonzero Lead Time
- The ABC Inventory
Classification

- Quantity Discounts
- The Production Model
- A Backorder Model
- Safety Stocks for

transportasi, selanjutnya dapat

menggunakannya untuk
penyelesaian masalah
transportasi
- Mahasiswa dapat memahami
masalah penugasan dan
metode penugasan serta dapat
mengaplikasikannya untuk
suatu penugasan
- Mahasiswa dapat memahami
mengenai : Nature and
Function of Inventories,
Economic Order Quantity
Model, Graph of The
Inventory Level Over Time,
The total Cost Equation,
Computing The EOQ
Mathematically, Sensitivity
Analysis, Nonzero Lead
Time, The ABC Inventory
Classification, Quantity
Disqounts, The Production
Model A Backorder Model,
Safety Stocks for Probabilistic
Demand

Probabilistics Demand
V

Queuing Models

- Memberikan Pemahaman
kepada Mahasiswa tentang
Queuing Models

- The Structure of Queuing

-

Model
Sensitivity of The Traffic
Intensity
Key Relationship
Multiple Channel Model
Cost Minimization Models
Non Poisson Service rates

- Mahasiswa dpaat memahami

tentang Structure of Queuing
Model, Sensitivity of The
Traffic Intensity, Key
Relationship, Multiple
Channel Model, Cost
Minimization Models, Non
Poisson Service Rates,
Different Type Of Customer

- Different Type Of Customer

VI

Project Management

- Memberikan Pemahaman
kepada Mahasiswa tentang
Project Management

VII

Time-Series Forecasting

- Memberikan Pemahaman
kepada Mahasiswa tentang
Time-Series Forecasting.

VIII

Decision Theory

- Memberikan Pemahaman
kepada Mahasiswa tentang
Teori keputusan

Classes
Self Service facilities
Queuing Network
Critical Path Method (CPM)
Cost/Time Trade-offs : A
Crashing Algorithm
Direct and Indirect Cost
Analysis
Time-Chart Scheduling of
Resources
Resource Leveling
Program Evaluation an
Review Techniques (PERT)
Classification of Forecasting
Methods
Moving Average System
Mean Absolute System
Single and Double
Exponential Smoothing
A Time-series Regression
Model
ARIMA Method
Monitoring Foreast
Performance
A Framework for Decision
Models
Classifying Decision
Problems
Probabilistic and Nonprobabilistic Decision Rules
Expected Value of Perfect
Information (EVPI)

Classes, Self Service

Facilities, and Queuing
Network

- Mahasiswa dapat memahami

tentang CPM, Crashing
Algorithm, dapat melakukan
analisis biaya, membuat TimeChart Scheduling dan PERT

- Mahasiswa dapat memahami

tentang: Classification of
Forecasting Methods, Moving
Average System, Mean
Absolute Deviation, Single
and Double Exponential
Smoothing, A Time-series
Regression Model, ARIMA
Method, Monitoring Forecast
Performance

- Mahasiswa dapat memahami

Decision Models, Classifying
Decision Problems,
Probabilistic and Nonprobabilistic Decision Rules,
Expected Value of Perfect
Information (EVPI), The
Concept of utility, Sequential

- The Concept of utility

- Sequential Decision Making
- Posterior Analysis
- Expected Value of Sample
IX

Information (EVIS)
- A Brand-Switching Model
- N-Step Transitions
- Steady-State Probabilities
- Decision-Making Applications
- Accounts Receivable Analysis

Markov Chains

- Memberikan Pemahaman
kepada Mahasiswa tentang
Markov Chains

Simulation

- Memberikan Pemahaman
kepada Mahasiswa tentang
Simulasi

- Memberikan Pemahaman

Goal Programming

kepada Mahasiswa tentang

Goal Programming, Integer
Programming, Dynamic
Programming
Integer Programming
Dynamic Programming

Decision Making, Posterior

Analysis, Expected Value of
Sample Information (EVIS)

Mahasiswa dapat memahami

tentang: Brand-Switching
Model, N-Step Transitions,
Steady-State Probabilities,
Decision-Making Applications
dan Accounts Receivable
Analysis
Machine Maintenance: A
- Mahasiswa dapat memahami
Simulation Analysis
tentang: Machine
Maintenance: A Simulation
Computer Simulation
Analysis, Computer
Simulation
Goal Programming: A Product Mahasiswa dapat memahami
Mix Problem
tentang goal programming,
Goal Trade-offs: The Use of
Integer Programming,
Differential weights
Dynamic Programming
Priority Levels
Introductory Concept
Graphical Solution of the Two
Variable Integer Program
Applications: IP Formulation
The shortest-Path problem
General Dynamic
Programming Concepts and
Notation
Resource Allocation Problems
The Dynamic Inventory
Problem

XI

XII

Network Optimization Methods

Branch and Bound Methods

Heuristics in Management Science

- Memberikan Pemahaman

- Shortest-Path Algoritm
kepada Mahasiswa tentang
- Minimal Spanning Tree
metode Network Optimization Algoritm
- Maximal flow Algoritm
Memberikan Pemahaman
- Political Campaigning: An
kepada Mahasiswa tentang
Assignment Problem
Branch and Bound Methods - Product Mix: A Pure Integer
Program

- Memberikan Pemahaman
kepada Mahasiswa tentang
Heuristics in Management
Science

- Heuristics for Dynamic

Demand Inventory Planning

Referensi:

1. Anderson, M., Q, Lievano, K., J., Quantitave Management an Introduction, Kent Publishing Comp., Boston, 1986
2. Lapin, L., Quantitave Methods for Business Decisions with cases, Harcourt Brace Jovanovich Inc, Orlando, 1988
3. Lee A.S., Liebenau J. & DeGross J.I., Information Systems and Qualitative Research, Chapman & Hall, 1997
4. Levin R.I.Et.All., Quantitative Approach to Management, McGraw-Hill International Editions, Singapore, 1989
5. Uma, Sekara, Research Methods for Business, John, Willey & Sons, Inc, New York, 2000

- Mahasiswa dapat memahami

tentang algoritma: ShortestPath, Minimal Spanning Tree,
dan Maximal flow Algoritm

- Mahasiswa dapat memahami

tentang: Political
Campaigning: An Assignment
Problem, Product Mix: A Pure
Integer Program
Mahasiswa dapat memahami
tentang Heuristics for
Dynamic Demand Inventory
Planning