This book constitutes the refereed proceedings of the 5th International Workshop on Multiple Access Communications, MACOM 2012, held in Maynooth, Ireland, in November 2012. The 13 full papers and 5 demo and poster papers presented were carefully reviewed and selected from various submissions. The papers are organized in topical sections on network coding, handling interference and localization techniques at PHY/MAC layers, wireless access networks, and medium access control.
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. This problem is known to be open. Here, we give some properties of optimal schedules for the problem and its special cases.
Consideration was given to a graphic realization of the method of dynamic programming. Its concept was demonstrated by the examples of the partition and knapsack problems. The proposed method was compared with the existing algorithms to solve these problems.