Solving Order Selection and Scheduling Problems by Dynamic Programming with Memory Scheme

Thesis

Lee, Chia-Jung

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

2013

Abstract

生產排程

訂單選擇

產出最大化

分支界線法

動態規劃

production scheduling

order selection

throughput maximization

branch-and-bound

dynamic programming

因申請專利緣故，資料延後公開

1 Record Views

Title: Solving Order Selection and Scheduling Problems by Dynamic Programming with Memory Scheme
Translated title: Solving Order Selection and Scheduling Problems by Dynamic Programming with Memory Scheme
Creators: Lee, Chia-Jung
Contributors: 洪一峯 (Advisor)
Awarding Institution: 國立清華大學, 工業工程與工程管理學系; Masters
Theses and Dissertations: Masters, 國立清華大學, 工業工程與工程管理學系
Language: English
Resource Type: Thesis
Date published: 2014