Kara, B.: SMTTP problem library, http://www.bilkent.edu.tr/ bkara/start.html (2002)  Home/Search   Document Not in Database   Summary   Related Articles

....This sections describes the benchmark instances we used in our analysis, the experimental design and our computational results. 5.1 Benchmark instances We generated a set of forty 100 and 200 job instances. 20 of these instances were taken from a problem library maintained by Bahar Kara [23] with a single instance per range of due date (RDD) and tardiness factor (TD) for each value pair for RDD in ##### #### #### # #### and TF in ##### #### #### #. RDD and TF are parameters that are used in a widely applied algorithm for generating instances of single processor tardiness problems ....

....with a single instance per range of due date (RDD) and tardiness factor (TD) for each value pair for RDD in ##### #### #### # #### and TF in ##### #### #### #. RDD and TF are parameters that are used in a widely applied algorithm for generating instances of single processor tardiness problems [2, 23]. In addition, we generated 20 instances using the same parameter value pairs. The so derived SPTTP instances were adapted to the multi processor case by dividing their due dates by the number of processors and rounding to the nearest integer. To evaluate the performance of our algorithms, we ....

Kara, B.: SMTTP problem library, http://www.bilkent.edu.tr/ bkara/start.html (2002)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC