Parallel Computation Dynamic Programming for Solving Order Selection and Scheduling Problems

Thesis

Tung, Kuan-Ting

Masters, 國立清華大學, 工業工程與工程管理學系所

2016

Abstract

產出最大化問題

生產排程

訂單選擇與排程

分枝界限法

動態規劃

OpenMP

throughput maximization problem

production scheduling

order selection and scheduling

branch-and-bound

dynamic programming

OpenMP

abstract hide

1 Record Views

Title: Parallel Computation Dynamic Programming for Solving Order Selection and Scheduling Problems
Translated title: Parallel Computation Dynamic Programming for Solving Order Selection and Scheduling Problems
Creators: Tung, Kuan-Ting
Contributors: Hung, Yi-Feng (Advisor)
Awarding Institution: 國立清華大學, 工業工程與工程管理學系所; Masters
Theses and Dissertations: Masters, 國立清華大學, 工業工程與工程管理學系所
Language: English
Resource Type: Thesis
Date published: 2017