東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Finite-horizon operations planning f...

Diponegoro, Ahmad.

FindBook

Google Book

Amazon

博客來

Finite-horizon operations planning for a lean supply chain system.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Finite-horizon operations planning for a lean supply chain system./
作者:	Diponegoro, Ahmad.
面頁冊數:	161 p.
附註:	Source: Dissertation Abstracts International, Volume: 64-07, Section: B, page: 3459.
Contained By:	Dissertation Abstracts International64-07B.
標題:	Engineering, Industrial. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3098065

Finite-horizon operations planning for a lean supply chain system.
Diponegoro, Ahmad.

Finite-horizon operations planning for a lean supply chain system. - 161 p.

Source: Dissertation Abstracts International, Volume: 64-07, Section: B, page: 3459.

Thesis (Ph.D.)--Louisiana State University and Agricultural & Mechanical College, 2003.

This dissertation studies an operational policy for a lean supply chain system consisting of a manufacturer, multiple suppliers and multiple buyers. The manufacturer procures raw materials from the suppliers and converts them into finished products, which are then shipped in batches to the buyers at certain intervals of times. Three distinct but inseparable problems are addressed: single supplier and single buyer with fixed delivery size (FD), multiple suppliers and multiple buyers with individual delivery schedule (MD), and time dependent delivery quantity with trend demand (TD). The mathematical formulations of these supply systems are categorized as mixed-integer, nonlinear programming problems (MINLAP) with discrete, non-convex objective functions and constraints.Subjects--Topical Terms:

626639
Engineering, Industrial.

Finite-horizon operations planning for a lean supply chain system.
LDR:03368nmm 2200313 4500 001 1863455
005 20041216101838.5
008 130614s2003 eng d
035 $a (UnM)AAI3098065
035 $a AAI3098065
040 $a UnM $c UnM
100 1 $a Diponegoro, Ahmad. $3 1950975
245 1 0 $a Finite-horizon operations planning for a lean supply chain system.
300 $a 161 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-07, Section: B, page: 3459.
500 $a Director: Bhaba R. Sarker.
502 $a Thesis (Ph.D.)--Louisiana State University and Agricultural & Mechanical College, 2003.
520 $a This dissertation studies an operational policy for a lean supply chain system consisting of a manufacturer, multiple suppliers and multiple buyers. The manufacturer procures raw materials from the suppliers and converts them into finished products, which are then shipped in batches to the buyers at certain intervals of times. Three distinct but inseparable problems are addressed: single supplier and single buyer with fixed delivery size (FD), multiple suppliers and multiple buyers with individual delivery schedule (MD), and time dependent delivery quantity with trend demand (TD). The mathematical formulations of these supply systems are categorized as mixed-integer, nonlinear programming problems (MINLAP) with discrete, non-convex objective functions and constraints.
520 $a The operations policy determines the number of orders of raw material, beginning and ending times of cycles, production batch size, production start time, and beginning and ending inventories. The goal is to minimize the cost of the two-stage, just-in-time inventory system that integrates raw materials ordering and finished goods production system. The policy is designed for a finite planning horizon with various phases of life cycle demands such as inception (increasing), maturity (level) and phasing out (declining).
520 $a Analytical results that characterize the exact, optimal policy for the problems described above are devised to develop efficient and optimal computational procedures. A closed-form heuristic that provides a near-optimal solution and tight lower bound is proposed for the problem FD. A network model to represent the problems is proposed and network-based algorithms are implemented to solve the problems FD, MD and TD optimally. The computational complexities of the algorithms are theta(N2) or O( N3) where N is the total number of shipments in the planning horizon. Numerical tests to assess the robustness and quality of the methods show that the present research provides superior results.
520 $a Production and supply chain management play an important role in ensuring that the necessary amounts of materials and parts arrive at the appropriate time and place. A manager, using the models obtained in this research, can quickly respond to consumers' demand by effectively determining the right policies to order raw materials, to deliver finished goods, and to efficiently manage their production schedule.
590 $a School code: 0107.
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Operations Research. $3 626629
650 4 $a Engineering, System Science. $3 1018128
690 $a 0546
690 $a 0796
690 $a 0790
710 2 0 $a Louisiana State University and Agricultural & Mechanical College. $3 783779
773 0 $t Dissertation Abstracts International $g 64-07B.
790 1 0 $a Sarker, Bhaba R., $e advisor
790 $a 0107
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3098065