Keywords: Single-machine sequencing Weighted number of tardy jobs Due date assignment a b s t r a c t The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n 4) time by formulating and solving a series of assignment...

In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in o...

Retrieving homologous sequences from existing databases is very important for the biomedical research community. In this project, we implemented four sequence alignment algorithms (general gap penalty, affine gap penalty, general gap penalty with mid-point and affine gap penalty with midpoint) to look for nearly optimum aligned sequences in the database for nucleic acid sequences (i.e. DNA/RNA ...

robot soccer team. The proposed strategy uses dynamic role assignment, which allows the team to have a flexible and robust strategy. Each role is defined as a state-machine, where each state triggers different behaviors. Transitions between states are triggered by internal and external robot conditions. The positions of the robots in the field are dynamically controlled using potential fields, ...

The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...

Efficient management of port resources plays a crucial role in reducing vessel stay times and avoiding the payment demurrage charges. In this paper, we focus on integrated Laycan Berth Allocation Quay Crane Assignment Problem, which considers three main decision problems an way: dynamic continuous Problem time-invariant Problem. second part, problem is extended to Specific Assignment, includes ...

The network travel time pattern plays a double role in within-day dynamic traffic assignment: on one side, it constitutes the main attribute in the context of users’ path choice; on the other side, it determines the arc flow pattern for given path choices. Then, it is important that in the supply model realistic arc performances are yielded for given arc inflows. On the other hand, the arc perf...

Ki-Dong Lee et al. 211 This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an...

Operative role management relates to delegating the right roles to the right resources at a specific moment. Role management is commonly understood as technical role management, relating to access control and administrative role management. Operative role management is the practical daily work of emergency organizations’ personnel and relates to overall resource management. The authors have car...