Academic
Publications
Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem

Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem,10.1007/s10852-009-9120-6,Journal of Mathematical Modelling and Algorithm

Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem  
BibTex | RIS | RefWorks Download
A new n log n algorithm for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective is proposed and its worst-case performance ratio is estimated. The algorithm iteratively combines partial solutions that are obtained by partitioning the set of jobs into suitable families of subsets. The computational behavior on three families of instances taken from the literature provided interesting results.
Journal: Journal of Mathematical Modelling and Algorithms - JMMA , vol. 9, no. 1, pp. 39-51, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.