Search results

Hybrid flow shop with multiprocessor task (HFSMT) has received considerable attention in recent years. The purpose of this paper is to consider an HFSMT scheduling under the environment of a common time window. The window size and location are considered to be given parameters. The research deals with the criterion of total penalty cost minimization incurred by earliness and tardiness of jobs. In this research, a new memetic algorithm in which a global search algorithm is accompanied with the local search mechanism is developed to solve the HFSMT with jobs having a common time window. The operating parameters of memetic algorithm have an important role on the quality of solution. In this paper, a full factorial experimental design is used to determining the best parameters of memetic algorithm for each problem type. Memetic algorithm is tested using HFSMT problems.

First, hybrid flow shop scheduling system and hybrid flow shop scheduling with multiprocessor task are defined. The applications of the hybrid flow shop system are explained. Also the background of hybrid flow shop with multiprocessor is given in the introduction. The features of the proposed memetic algorithm are described in Section 2. The experiment results are presented in Section 3.

Computational experiments show that the proposed new memetic algorithm is an effective and efficient approach for solving the HFSMT under the environment of a common time window.

There is only one study about HFSMT scheduling with time window. This is the first study which added the windows to the jobs in HFSMT problems.

The main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.

The paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives.

Both partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used.

The simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments.

The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.

This paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.

In client/server distributed systems, the server is often the bottleneck. Improving the server performance is thus crucial for improving the overall performance of distributed information systems. Real‐time system is required to complete its work and deliver its services on a timely basis. The purpose of this paper is to propose a new scheduling algorithm for real‐time distributed system (client/server model) to achieve the above‐mentioned goal.

The ant colony optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. They provide inherent parallelism and robustness. Therefore, they are appropriate for scheduling of tasks in soft real‐time systems. During simulation, results are obtained with periodic tasks, measured in terms of success ratio and effective CPU utilization; and compared with results of earliest deadline first (EDF) algorithm in the same environment.

Analysis and experiments show that the proposed algorithm is equally efficient during underloaded conditions. The performance of EDF decreases as the load increases, but the proposed algorithm works well in overloaded conditions also. Because of this type of property, the proposed algorithm is more suitable for the situation when future workload of the system is unpredictable.

The application of ACO algorithms for scheduling of client/server real‐time distributed system, never found before in the literature. The new concept proposed in this paper will be of great significance to both theoretical and practical research in scheduling of distributed systems in the years to come.

BIOMEDICAL CYBERNETICS The University of Illinois (U.S.A.) anatomic path‐ology natural language dictionary, called LEXICON, has evolved over a nine‐year period through several organizations and updates to its present form. It is the result of scanning over one million words of narrative text from tissue examination request forms and surgical pathology reports. The text is passed into individual words which are looked up in LEXICON and flagged by action codes which determine usage in constructing a KWIC index file and an on‐line database retrievable by keywords.

It is common knowledge that during the last decade markets have become extremely competitive with product variety increasing continuously and product life cycles shortening. Many manufacturing companies, which hitherto satisfied their customers while operating specific production systems, were recently obliged to reconsider because of the potential superiority of other “manufacturing philosophies”. In the literature, we meet a great variety of production systems and manufacturing philosophies, while, on the other side, in industry we usually find different combinations of “primary” productions systems. In this paper, we present the existing “state‐of‐the‐art” theoretical and experiential knowledge about productions systems, as well as describe their basic characteristics in a useful, exact and comprehensive way for practitioners and software houses who want to have a knowledge base for further research and practical implementation in the wider field of production management, planning and scheduling.

The concept of business process (BP) as a service is a new solution in enterprises for the purpose of using specific BPs. BPs represent combinations of software services that must be properly executed by the resources provided by a company’s information technology infrastructure. As the policy requirements are different in each enterprise, processes are constantly evolving and demanding new resources in terms of computation and storage. To support more agility and flexibility, it is common today for enterprises to outsource their processes to clouds and, more recently, to cloud federation environment. Ensuring the optimal allocation of cloud resources to process service during the execution of workflows in accordance with user policy requirements is a major concern. Given the diversity of resources available in a cloud federation environment and the ongoing process changes required based on policies, reallocating cloud resources for service processing may lead to high computational costs and increased overheads in communication costs.

This paper presents a new adaptive resource allocation approach that uses a novel algorithm extending the natural-based intelligent water drops (IWD) algorithm that optimizes the resource allocation of workflows on the cloud federation which can estimate and optimize final deployment costs. The proposed algorithm is implemented and embedded within the WokflowSim simulation toolkit and tested in different simulated cloud environments with different workflow models.

The algorithm showed noticeable enhancements over the classical workflow deployment algorithms taking into account the challenges of data transfer. This paper made a comparison between the proposed IWD-based workflow deployment (IWFD) algorithm with other proposed algorithms. IWFD presented considerable improvements in the makespan, cost and data transfer in most situations in the cloud federation environment.

An extension for WorkflowSim to support the implementation of BPs in a federation cloud space regarding BP policy. Optimize workflow execution performance in Federated clouds by means of IWFD algorithm.

purpose of this paper is providing a solution for flexible flow shop scheduling problem with uncertain processing time in aeronautical composite lay-up workshop.

A flexible flow scheduling model and algorithm with interval grey processing time is established. First, according to actual needs of composite laminate shop scheduling process, interval grey number is used to represent uncertain processing time, and interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart, and other methods are further applied. Then a flexible flow shop scheduling model with interval grey processing time (G-FFSP) is established, and an artificial bee colony algorithm based on an adaptive neighbourhood search strategy is designed to solve the model. Finally, six examples are generated for simulation scheduling, and the efficiency and performance of the model and algorithm are evaluated by comparing the results.

Results show that flexible flow shop scheduling model and algorithm with interval grey processing time can provide an optimal solution for composite lay-up shop scheduling problems and other similar flow shop scheduling problems.

Uncertain processing time is common in flexible workshop manufacturing, and manual scheduling greatly restricts the production efficiency of workshop. In this paper, combined with grey system theory, an intelligent algorithm is used to solve flexible flow shop scheduling problem to promote intelligent and efficient production of enterprises.

This paper applies and perfects interval grey processing time measurement method, grey number calculation and comparison rules, grey Gantt chart and other methods. A flexible flow shop scheduling model with interval grey processing time is established, and an artificial bee colony algorithm with an adaptive domain search strategy is designed. It provides a comprehensive solution for flexible flow shop scheduling with uncertain processing time.

Cloud users can access services at anytime from anywhere in the world. On average, Google now processes more than 40,000 searches every second, which is approximately 3.5 billion searches per day. The diverse and vast amounts of data are generated with the development of next-generation information technologies such as cryptocurrency, internet of things and big data. To execute such applications, it is needed to design an efficient scheduling algorithm that considers the quality of service parameters like utilization, makespan and response time. Therefore, this paper aims to propose a novel Efficient Static Task Allocation (ESTA) algorithm, which optimizes average utilization.

Cloud computing provides resources such as virtual machine, network, storage, etc. over the internet. Cloud computing follows the pay-per-use billing model. To achieve efficient task allocation, scheduling algorithm problems should be interacted and tackled through efficient task distribution on the resources. The methodology of ESTA algorithm is based on minimum completion time approach. ESTA intelligently maps the batch of independent tasks (cloudlets) on heterogeneous virtual machines and optimizes their utilization in infrastructure as a service cloud computing.

To evaluate the performance of ESTA, the simulation study is compared with Min-Min, load balancing strategy with migration cost, Longest job in the fastest resource-shortest job in the fastest resource, sufferage, minimum completion time (MCT), minimum execution time and opportunistic load balancing on account of makespan, utilization and response time.

The simulation result reveals that the ESTA algorithm consistently superior performs under varying of batch independent of cloudlets and the number of virtual machines’ test conditions.

Planning and scheduling are forms of decision making, which play a crucial role in manufacturing as well as in service industries. In the current competitive environment, effective sequencing and scheduling has become a necessity for survival in the marketplace. A great challenge for today’s companies is not only how to adapt to this changing, competitive business environment but also how to draw a competitive advantage from the way in which they choose to do so. Intelligent solutions, based on expert systems, to solve problems in the field of production planning and scheduling are becoming more and more widespread nowadays. Proposes an expert system, which uses the prevailing conditions in the industrial environment in order to select and “fire” dynamically the most appropriate scheduling algorithm from a library of many candidate algorithms.