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 |