The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper studies a real-world hybrid flow shop problem arising from the steelmaking continuous casting process, which is the bottleneck of the iron and steel production. There are a variety of features to be taken into account, in particular the batch constraints and the variable processing times in the last stages. Based on a time-index formulation and machine capacity relaxation, three Lagrangian...
An approach with decomposition on time windows is proposed to solve resource-constrained project scheduling problem (RCPSP) in this paper. This approach is to decompose the feasible space calculated by CPM of the original problem into some subspaces, which are searched using some schedule schema. Double justification is also performed in the search to improve the results. The results of experiments...
The utilization bounds for partitioned multiprocessor scheduling are a function of task allocation algorithms and the schedulability conditions selected for uniprocessor scheduling algorithms. In this paper, we use rate-monotonic scheduling on each processor and present the lower and upper limits of the utilization bounds for all reasonable task allocation heuristics. Unlike previous work, the hyperbolic...
Master thesis defense scheduling problem is a real-world practical problem that arises from the Vietnamese Universities. In this paper, we give the formulation of the problem based on realistic requirements. We then show that the considered problem is NP-hard and propose a genetic algorithm for solving it. We experiment the proposed algorithm on the real problem instances taken from Hanoi University...
Flight landing optimization at the terminal area is an ongoing challenge for air traffic controllers. The current schedule scheme is first-come-first-served (FCFS). There are studies focusing on how to minimize the total cost or maximize the throughput. These schemes are short of fairness consideration. In this paper, we start from a real recent example to show that a lack of consideration of long-term...
This paper considers the two-machine flow shop scheduling problem to minimize the sum of completion times. We design two heuristic algorithms, Triangle Shortest Processing Time first (TSPT) and Dynamic Triangle Shortest Processing Time first (DTSPT), for problems F2∥ΣCj and F2|rj|ΣCj respecttively. Moreover, to further evaluate the heuristics numerically, two new lower bounds with performance guarantee...
Grid applications run on environment that is prone to different kinds of failures. Fault tolerance is the ability to ensure successful delivery of services despite faults that may occur. Our research adds fault tolerance capacity with checkpointing and machine failure, to the current research, Selected Most Fitted (SMF) Task Scheduling for grid computing. This paper simulates one of fault tolerance...
This paper investigates the problem of link scheduling to meet traffic demands with minimum airtime in a multi-transmit-receive (MTR) wireless network. MTR networks are a new class of networks, in which each node can simultaneously transmit to a number of other nodes, or simultaneously receive from a number of other nodes. The MTR capability can be enabled by the use of multiple directional antennas...
In this study, we propose a clustering technique based on FP-tree algorithm to group students based on the intended courses they will register for a given next semester. The goal of this clustering is to solve the problem of course's time scheduling that we encountered in previous semesters which prevented students from enrolling in some of these courses as they are being scheduled at the same time...
The Educational timetabling problem is a common and hard problem inside every educative institution, this problem tries to coordinate Students, Teachers, Classrooms and Timeslots under certain constrains that dependent in many cases the policies of each educational institution. The idea behind hyper-heuristics is to discover some combination of straightforward heuristics to solve a wide range of problems...
The rate-monotonic scheduling algorithm is a static scheduling algorithm for periodic tasks, but the classic rate-monotonic scheduling algorithm only determines the task's priority by its period, the deadline of long period and important tasks can not be guaranteed. Here, a new static scheduling algorithm called DPSS. The integrated priority tasks obtained by calculating the two parameters-running...
Workflow process mining technology is not a tool of workflow design, but it is very useful for understanding the current business processes. Workflow process mining does well in knowledge management and decision-making support. The dynamic flow control and fuzziness make the old methods that analysis the performance of workflow not applicable. In order to solve the problem a new workflow process mining...
Reasonable resource deployment is an important guarantee for grid effective service. From industry application perspective, the resources is constrained by property, so as to GDCS have to deal with conflicts resulting from resource sharing. Based on the hierarchical task scheduling model, the incomplete resource deployment strategy was proposed in this paper. Firstly, queuing theory is used to solve...
As Grid networks grows, the complexity of resource management in Grid networks dramatically increases. To manage the Grid resources efficiently, policy based resource management system is suitable. However, the policy which made at a moment could not be appropriate to other time because the condition of the grid resources with time space changes. Thus, in this paper, we propose asynchronous policy-based...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.