Scheduling jobs with release dates on identical machines to minimize weighted completion times function
journal of kerbala university,
2012, Volume 8, Issue 1, Pages 122-133
AbstractThis paper considers the problem of scheduling independent jobs with release dates on m identical machines to find minimize the total weighted completion times. The purpose of this paper is to describe meta-heuristic algorithms such as Memetic algorithm approach (MA),Threshold acceptance algorithm (TA) and Tabu search (TS), in order to find near optimal solution (feasible solution) to minimize the total weighted completion time which subject to release dates. The problem denoted as .
- Article View: 117
- PDF Download: 105