The aim of this study is to propose a new mixed integer linear programming (MILP) model to find the minimum required number of yard cranes, Rubber tyred gantry cranes (RTGCs), for completion the total amount of works at the end of planning horizon. In other word, we find the optimal number of yard cranes in a container terminal which completes the total amount of works. The paper supports the p...

Abstract We consider a random walker on ring, subjected to resetting at Poisson-distributed times the initial position (the takes shortest path along ring times). In case of Brownian mean first-completion time turn is expressed in closed form as function rate. The value shorter than ordinary process if rate low enough. Moreover, can be minimised At large distribution winding numbers does not re...

The linear bottleneck assignment problem (LBAP), which is a variation of the classical assignment problem, seeks to minimize the longest completion time rather than the sum of the completion times when a number of jobs are to be assigned to the same number of workers. If the completion times are not certain, then it is said to be a fuzzy LBAP. Here we propose a new algorithm to solve fuzzy LBAP...

A combination chemotherapy of paclitaxel plus carboplatin (TC) is the most frequently used regimen for gynecological malignancies. As long as it effective, a carboplatin-containing every relapse. This implies that number platinum administrations and frequency hypersensitivity reaction (HSR) increase prognosis improves. When patient develops HSR to carboplatin, we have three options: 1) desensit...

Off-line scheduling and fixed priority scheduling (FPS) are often considered as complementing and incompatible paradigms. A number of industrial applications demand temporal properties (predictability, jitter constraints, endto-end deadlines, etc.) that are typically achieved by using off-line scheduling. The rigid off-line scheduling schemes used, however, do not provide for flexibility. FPS h...