Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
To establish a real closed-loop control centre testing environment for a cyber–physical power system, a cyber–physical testbed was established by integrating industry supervisory control and data acquisition with a source-grid co-simulation system in the laboratory at the North China Electric Power University. The testbed employs a multi-time scale interface and virtual remote terminal units to overcome...
This paper presents a traffic signal scheduling strategy with consideration of both pedestrians and vehicles in the urban traffic system. Firstly, a novel mathematical model consisting of several logic constraints is proposed to describe the pedestrian flow in the urban traffic network and its dynamics are developed based on the crossing rules. Secondly, a mathematical model about the vehicle traffic...
This paper focuses on the production scheduling problem in a rotor workshop. The scheduling problem is formulated as a reentrant hybrid flow shop problem with non-identical machines in parallel. Some heuristics are developed to solve the problem. The proposed algorithms are compared through various instances that are generated based on real operations in the workshop. Experimental result also reveals...
Bag-of-Tasks (BoT) applications consisting of multiple tasks widely exist in numerous fields. As customers use cloud resources in a pay-as-you-go way, they are willing to execute BoT applications on clouds. Cloud providers and customers establish contracts in which applications' due dates are specified. If an application cannot be finished before the due date, the cloud provider should pay a tardiness...
Recent theoretical studies have shown that partitioning-based scheduling has better real-time performance than other scheduling paradigms like global scheduling on multi-cores. Especially, a class of partitioning-based scheduling algorithms (called semi-partitioned scheduling), which allow to split a small number of tasks among different cores, offer very high resource utilization. The major concern...
Based on the consideration of the client and the contractor's joint project profit, a compromise thought that both the client and the contractor deviate from their respective ideal solutions by an equal percentage is proposed, an optimization model of payment scheduling with generalized precedence relations in the progress payment model is constructed. Ultimately, an example is given to demonstrate...
In this paper, a Quantum-inspired Iterated Greedy algorithm (QIG) is proposed for permutation flowshops with the objective to minimize the total flowtime. A hybrid representation is adopted to construct a Q-job by combining a job with a Q-bit. Solutions denoted by permutations of Q-jobs can be evaluated directly. The initial solution is generated by an effective heuristic, in which the Q-bits of the...
This paper focuses on multi-user scheduling in downlink relay-aided cellular network. Based on conventional scheduling rules (Round Robin (RR), Max Carrier-to-Interference ratio (Max C/I), and Proportional Fair (PF)), we propose backhaul and access scheduling algorithms under centralized and distributed mechanism, respectively. We evaluate and compare the network performance through system-level simulation...
Timing correctness of hard real-time systems is guaranteed by schedulability analysis and worst-case execution time (WCET) analysis of programs. Traditional WCET analysis mainly deals with application programs and has achieved success in industry. Timing analysis of application programs along cannot guarantee correctness of complete systems consisting RTOS. WCET tools designed for application program...
In the paper, a similarity based ant-colony algorithm (SACO) is proposed for the permutation flowshop scheduling problems with total flowtime minimization, which is known as NP-hard. By applying the space mapping method which is testified to be reasonable, it is proved theoretically that the deposit factor rho has hardly impact on the ACO evolutionary availability, and rho = 0.5 is reasonable for...
In this paper, a composite heuristic algorithm is proposed for permutation flowshop scheduling problems (PFSP) with total flowtime minimization, which are well known NP-hard. Besides initialized by LR(n/m), solution of the proposal is developed by iteration of FPE or BPE alternatively. Perturbation is applied to escape from the local optimization when no improvement can be obtained during the development...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.