東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Interval alignment policies and thei...

Wang, Meimei.

Linked to FindBook

Google Book

Amazon

博客來

Interval alignment policies and their applications.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Interval alignment policies and their applications./
Author:	Wang, Meimei.
Description:	118 p.
Notes:	Adviser: James R. Perkins.
Contained By:	Dissertation Abstracts International67-09B.
Subject:	Engineering, Industrial. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3232932
ISBN:	9780542869488

Interval alignment policies and their applications.
Wang, Meimei.

Interval alignment policies and their applications. - 118 p.

Adviser: James R. Perkins.

Thesis (Ph.D.)--Boston University, 2007.

Dynamic scheduling of parts, or jobs, is an area of intense research interest. Commonly, dynamic scheduling is done either on a heuristic basis or using queueing network models. Minimization of the average lead time (the time spent in the system by a part) is one of the primary performance objectives for a scheduling policy. From Little's Law, this is equivalent to minimization of the average work-in-process (WIP).

ISBN: 9780542869488Subjects--Topical Terms:

626639
Engineering, Industrial.

Interval alignment policies and their applications.
LDR:03869nam 2200337 a 45 001 967539
005 20110915
008 110915s2007 eng d
020 $a 9780542869488
035 $a (UMI)AAI3232932
035 $a AAI3232932
040 $a UMI $c UMI
100 1 $a Wang, Meimei. $3 1291409
245 1 0 $a Interval alignment policies and their applications.
300 $a 118 p.
500 $a Adviser: James R. Perkins.
500 $a Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5332.
502 $a Thesis (Ph.D.)--Boston University, 2007.
520 $a Dynamic scheduling of parts, or jobs, is an area of intense research interest. Commonly, dynamic scheduling is done either on a heuristic basis or using queueing network models. Minimization of the average lead time (the time spent in the system by a part) is one of the primary performance objectives for a scheduling policy. From Little's Law, this is equivalent to minimization of the average work-in-process (WIP).
520 $a In this dissertation, a new class of detailed scheduling policies, called interval alignment (IA) policies, is introduced. IA policies are based on the idea that there is no benefit to have a part arrive to a machine before it will receive processing from that machine. By adding delays to the system, IA policies effectively synchronize part flows, reducing waiting times at the machines.
520 $a In the past decade, much effort has been put into removing variability from the flow of material in systems. Significant progress has been made on this front, demonstrating the advantages of near-periodic release policies and explicit modeling of bounded processing times. The proposed IA policies effectively utilize these smoothed part flows to improve performance by decreasing the average system WIP and the average lead time. For a range of systems, IA policies are shown to outperform best-practice policies that currently are used both in academia and in industry.
520 $a The performance of heuristic policies is heavily system-specific. For example, the commonly-used First-Come-First-Served (FCFS) policy can result in unbounded WIP. However, using the IA scheduling policies introduced in this dissertation, it is shown that, by adding intermediate delays to the system, FCFS scheduling will become stable and may become the optimal policy.
520 $a In addition, in order to obtain computationally feasible results, queueing network models typically either rely on asymptotic assumptions (e.g., heavy traffic or light traffic arrival processes) or are Markovian (i.e., utilize exponential probability distributions). However, many real-world systems do not operate under asymptotic conditions and do not naturally adhere to the Markovian structure. For example, in supply chain systems and project management, processing-time distributions are often bounded within specification levels (e.g., uniform or triangular distributions). Such systems are characterized by low variation. As will be shown, IA scheduling policies are effective for these systems.
520 $a The primary focus of this dissertation is on the utilization of IA policies in order to reduce the average WIP in a system, for systems with low-to-moderate variability in processing times, interarrival times, demand rates, machine reliability, etc. In addition to scheduling in manufacturing systems, other application areas discussed include the use of IA policies in supply chain management, kanban-controlled systems, facility layout and capacity design, and work cell design.
590 $a School code: 0017.
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Engineering, System Science. $3 1018128
690 $a 0546
690 $a 0790
710 2 0 $a Boston University. $3 1017454
773 0 $t Dissertation Abstracts International $g 67-09B.
790 $a 0017
790 1 0 $a Perkins, James R., $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3232932