search query: @indexterm PROBLEM FORMULATION / total: 70
reference: 20 / 70
| Author: | Wein, L.M. Chevalier, P.B. |
| Title: | A broader view of the job-shop scheduling problem |
| Journal: | Management Science
1992 : JUL, VOL. 38:7, p.1018-1033 |
| Index terms: | JOB-SHOP SCHEDULING PROBLEM FORMULATION NETWORKS OPTIMIZATION QUEUING THEORY |
| Language: | eng |
| Abstract: | A job-shop scheduling problem has been defined with three dynamic decisions: assigning due-dates to exogenously arriving jobs, releasing jobs from a backlog to the shop floor, and sequencing jobs to each of two workstations in the shop. The job-shop is modeled as a multiclass queueing network, and the objective is to minimuze both the work-in-process (WIP) inventory on the shop floor and the due-date lead time of jobs. A general two-step approach to this problem is proposed: 1. release and sequence jobs in order to minimize WIP inventory subject to completing jobs at a specified rate, 2. set due-dates that will attempt to minimize the due-date lead time. Three scheduling principles are proposed, based on the results. |
SCIMA