کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475324 | 699286 | 2009 | 10 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Scheduling reentrant jobs on parallel machines with a remote server Scheduling reentrant jobs on parallel machines with a remote server](/preview/png/475324.png)
This paper explores a specific combinatorial problem relating to reentrant jobs on parallel primary machines, with a remote server machine. A middle operation is required by each job on the server before it returns to its primary processing machine. The problem, which is new to the literature, is inspired by the logistics of a semi-automated microbiology laboratory. We establish the NP-hard nature of the problem, and demonstrate various structural properties. A heuristic is developed and tested on randomly generated benchmark data. No alternative heuristics are available in the literature for comparison, but results indicate solutions reliably within 1.5% of optimum. Moreover, tests of our heuristic on real-life data from the microbiology laboratory provide a 20% improvement in throughput relative to current practice.
Journal: Computers & Operations Research - Volume 36, Issue 9, September 2009, Pages 2580–2589