Checkerboard patterns, also known as 1-group patterns, belong to a special class of 2-stage guillotine patterns that do not need recuts. Such patterns are easier to cut, hence, they demand less machine time. They are ...
详细信息
We consider a two-machine flow shop problem with a common due date where the objective is to minimize the sum of functions which penalize early as well as tardy completion of jobs. Since the problem is NP-hard in the ...
详细信息
This article examines the problem of balancing a manual assembly line. By reducing a "mixedmodel" line problem to a "single-model" one, an exact balancing algorithm has been proposed and compared w...
详细信息
ISBN:
(纸本)9780976348696
This article examines the problem of balancing a manual assembly line. By reducing a "mixedmodel" line problem to a "single-model" one, an exact balancing algorithm has been proposed and compared with some of the most commonly used balancing methods.
In this paper, we study the delay minimization problem for wireless data broadcasting in cognitive radio networks (CRN). In CRN, each secondary user (SU) has a set of available channels to communicate with each other ...
详细信息
ISBN:
(纸本)9781479913510
In this paper, we study the delay minimization problem for wireless data broadcasting in cognitive radio networks (CRN). In CRN, each secondary user (SU) has a set of available channels to communicate with each other but there may not be a common available channel set among all the SUs. Therefore, a simple way to shorten the broadcasting delay among them is to select a minimal set of available channels which cover all SUs in the network. However, this scheme may incur a fairness problem in resource sharing among SUs and also lower the system resource utilization. To tackle this problem, we assign channels to SUs for data broadcasting service in downlink sub-frames by jointly considering broadcast delay minimization and fair resource sharing. We formulate this problem as a nonlinear integer programming problem, and show that it is NP-hard by applying a reduction from the 3-dimensional matching problem. We then propose an enumerative algorithm to find an optimal solution and design a greedy-based polynomial-time heuristic algorithm to reduce the computational complexity. The simulation results show that our enumerative algorithm not only effectively reduces the broadcasting delay but also ensures the fairness among SUs in resource sharing. We also show that the performance gap between our enumerative algorithm and our heuristic algorithm is small.
A new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting. For a random graph G, the probability of containing (d(G) + 1)-clique i...
详细信息
A new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting. For a random graph G, the probability of containing (d(G) + 1)-clique in G is obviously bigger than that of containing δ(G)-clique or Δ(G)-clique. Practical operating of this algorithm on random graph indicates that, compared with other algorithms, the algorithm proposed in this paper is more effective easier to operate.
暂无评论