A Broader View of the Job-Shop Scheduling Problem
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 sh...
| Main Authors: | , |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Online Access: | http://hdl.handle.net/1721.1/5389 |
| _version_ | 1811076434083446784 |
|---|---|
| author | Wein, Lawrence M. Chevalier, Philippe B. |
| author_facet | Wein, Lawrence M. Chevalier, Philippe B. |
| author_sort | Wein, Lawrence M. |
| collection | MIT |
| 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. |
| first_indexed | 2024-09-23T10:22:00Z |
| format | Working Paper |
| id | mit-1721.1/5389 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T10:22:00Z |
| publishDate | 2004 |
| publisher | Massachusetts Institute of Technology, Operations Research Center |
| record_format | dspace |
| spelling | mit-1721.1/53892019-04-12T08:16:35Z A Broader View of the Job-Shop Scheduling Problem Wein, Lawrence M. Chevalier, Philippe B. 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. 2004-05-28T19:37:11Z 2004-05-28T19:37:11Z 1989-12 Working Paper http://hdl.handle.net/1721.1/5389 en_US Operations Research Center Working Paper;OR 206-89 1969164 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center |
| spellingShingle | Wein, Lawrence M. Chevalier, Philippe B. A Broader View of the Job-Shop Scheduling Problem |
| title | A Broader View of the Job-Shop Scheduling Problem |
| title_full | A Broader View of the Job-Shop Scheduling Problem |
| title_fullStr | A Broader View of the Job-Shop Scheduling Problem |
| title_full_unstemmed | A Broader View of the Job-Shop Scheduling Problem |
| title_short | A Broader View of the Job-Shop Scheduling Problem |
| title_sort | broader view of the job shop scheduling problem |
| url | http://hdl.handle.net/1721.1/5389 |
| work_keys_str_mv | AT weinlawrencem abroaderviewofthejobshopschedulingproblem AT chevalierphilippeb abroaderviewofthejobshopschedulingproblem AT weinlawrencem broaderviewofthejobshopschedulingproblem AT chevalierphilippeb broaderviewofthejobshopschedulingproblem |