Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5389Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Wein, Lawrence M. | - |
| dc.creator | Chevalier, Philippe B. | - |
| dc.date | 2004-05-28T19:37:11Z | - |
| dc.date | 2004-05-28T19:37:11Z | - |
| dc.date | 1989-12 | - |
| dc.date.accessioned | 2013-10-09T02:39:29Z | - |
| dc.date.available | 2013-10-09T02:39:29Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5389 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | We define a job-shop scheduling problem with three dynamic decisions: assigning duedates to exogenously arriving jobs, releasing jobs from a backlog to the shop floor, and sequencing jobs at each workstation in the shop. The objective is to minimize both the work-in-process (WIP) inventory on the shop floor and the due-date lead time (due-date minus arrival date) of jobs, subject to an upper bound constraint on the proportion of tardy jobs. A general two-step approach to this problem is proposed: (1) release and sequence jobs in order to minimize the WIP inventory subject to completing jobs at a specified rate, and (2) given the policies in (1), set due-dates that will attempt to minimize the due-date lead time, subject to the job tardiness constraint. A simulation study shows that this approach easily outperforms other combinations of traditional due-date setting,job release, and priority sequencing policies. As a result of the study, three scheduling principles are proposed that can significantly improve the performance of a job shop. In particular, better due-date performance can be achieved by ignoring due-dates on the shop floor. | - |
| dc.format | 1969164 bytes | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | - |
| dc.relation | Operations Research Center Working Paper;OR 206-89 | - |
| dc.title | A Broader View of the Job-Shop Scheduling Problem | - |
| dc.type | Working Paper | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.