Simulation-based Ordinal Optimization Methods with Applications to Production Scheduling (3/3)
Date Issued
2005-07-31
Date
2005-07-31
Author(s)
DOI
932212E002082
Abstract
The third year of research efforts developed
scheduling methods in three aspects. (1) The
design of ordinal optimization-based value
iteration algorithm (OOBVI) combines ordinal
optimization (OO) with simulation-based value
iteration (SBVI) into an efficient method for
solving complex stationary Markov decision
problems (StMDPs). The method lays a
foundation for dynamic composition of production
scheduling policies via quick simulation. (2) A
reverse auction-based model captures the gaming
interactions between order assignments from a
design house and the production
planning/scheduling of individual contract
manufacturers (fabs). The model enables
quantitative analysis and simulation study of the
production planning/scheduling policies in a
co-opetition setting. (3) A study compares
Lagrange relaxation-based and Tabu search-based
single machine scheduling algorithm over a
satellite imaging problem.
Subjects
Ordinal Optimization
Simulation
Value Iteration
Algorithm Design
Reverse
Auction
Auction
Production Scheduling
Publisher
臺北市：國立臺灣大學電機工程學系暨研究所
Type
report
File(s)![Thumbnail Image]()
Loading...
Name
932212E002082.pdf
Size
712.91 KB
Format
Adobe PDF
Checksum
(MD5):04d67533c769921cb0e3493dc823e6d3