Article ID: | iaor2009259 |
Country: | Netherlands |
Volume: | 111 |
Issue: | 2 |
Start Page Number: | 812 |
End Page Number: | 821 |
Publication Date: | Jan 2008 |
Journal: | International Journal of Production Economics |
Authors: | Golenko-Ginzburg Dimitri, Laslo Zohar, Kerena Baruch |
Keywords: | simulation: applications |
We treat a virtual job-shop problem of sequencing n jobs on m unique machines. Each machine is outsourced with known renting cost per time unit. The job-operation processing times have random durations, and each job has its tardiness penalty function. The objective is to determine in advance the machine booking schedule that maximizes an economic gain. We present a simulation based on a cyclic coordinate descent search-algorithm and greedy priority dispatching rule that delivers a rent timetable that minimizes the expected total cost.