Concept Of Scheduling Research Articles

A novel resilient scheduling paradigm integrating operation and design for manufacturing systems with uncertainties

ABSTRACTThe resilience property is critical to the practical operations of an enterprise system, since the unforeseen circumstances would seriously degrade the system performance. This paper first discusses the concept of resilient scheduling for manufacturing systems, then proposes a three-layer resilient scheduling paradigm to divide the control policy into three modes, which are the processing sequence regulation, the system parameter adjustment, and the structure modification. Subsequently, a big data driven framework is designed to protect the manufacturing systems from these changes. Finally, a case study about aircraft horizontal tail assembly shop is implemented to illustrate the effectiveness of the data driven resilient scheduling framework.

Multithread Affinity Scheduling Using a Decision Maker

In a multiprocessor-multithread Operating System (OS), scheduling has two dimensions. The operating system has to decide which thread to run and which Central Processing Unit (CPU) to run it on. Assume the threads are independent and each thread has a priority, the operating system selects a thread with the highest priority and assigns it to the first free CPU. Usually, each CPU has its private cache. To increase the throughput of the system, it is preferred to use affinity scheduling. The affinity scheduling concept is to make an effort to have a thread run on the same CPU it ran on the last time. The existing affinity scheduling is implemented by using a two-level scheduling algorithm. In this paper a new approach is designed to implement independent multithread scheduling on a multiprocessor system. The design approach uses a decision maker to compute a new priority for each ready thread according to the thread pre-priority and affinity. The results show that by using the new priority, the goal of having affinity is satisfied in addition to taking the pre-priority of the thread in consideration. Also, the design approach reduces the scheduling time because it implements affinity scheduling and priority scheduling by employing a one level scheduling algorithm.

A Literature Review on Robust Project Scheduling Under Uncertainty

With the rapid development of the project management practice, large and super large scale projects become more and more common. such as aerospace engineering, logistics engineering and transportation engineering. Modern engineering has many uncertain characteristics, for instance, it has many participators, large scope and time, resource limit. The new management methods and project scheduling methods is needed urgently. Robust project scheduling which is one of project scheduling methods has become a key research field. This paper reviews the research achievement under uncertainty in three aspects: the concept of robust project scheduling and robustness measure, proactive project scheduling, reactive project scheduling. After all, the research directions are forecast in the future research.

Three-parameter Shift Schedule of Automatic Mechanical Transmission for Electric Bus

Shift schedule, directly affecting the vehicle’s performances, plays an important role in electric vehicle equipped with AMT to microgrid system. While the most widely used schedule, two-parameter shift schedule, ignoring the influence of dynamic conditions, resulting in the problem that it is hard to suit the road and cause energy waste. This paper proposed the concept of equivalent slope and three-parameter shift schedule based on vehicle velocity, acceleration and throttle opening, which makes vehicles have the optimal performance in dynamic conditions. The simulation results show the three-parameter shift schedule can reduce energy consumption and enhance vehicles’ dynamic performance effectively.

Clinician perspectives of an avatar-directed scheduling and memory aid

An avatar-directed scheduling and memory aid app (Anna Cares™) was identified as a potential solution to scheduling difficulties in busy rehabilitation services. However, there are well-documented difficulties with clinician acceptance and uptake of technology. This study investigated clinician perspectives of Anna Cares for use within two rehabilitation teams. Two focus groups were conducted with sixteen clinicians from various disciplines working in two rehabilitation settings at a metropolitan hospital in Adelaide (SA, Australia). Focus groups aimed to explore, clinicians’ perceptions of acceptability and usefulness of the app, and their attitudes towards this type of technology in general. Clinicians also completed self-assessed technology proficiency, perceived usefulness, and perceived ease of use scales. Clinicians described time constraints and the reliable scheduling of therapy sessions to be of significant importance, and they welcomed technology that could assist with this. They liked the concept of the avatar and found the app novel and fun. However, the preparation of the app for use with patients was problematic and time consuming. The more experienced clinicians found the app more difficult to use ( r = .586, P = .027) and did not see the app as beneficial to their patients nor did the technology add value to delivery of care. There was a significant relationship between age and mean value for ease of use ( r = .540, P = .046) but no significant relationship between age or experience, and the mean score for usefulness. Nor did there appear to be a relationship between self-assessed level of technology proficiency and either perceived usefulness and perceived ease of use. Although clinicians appreciated the concept of an avatar-directed scheduling and memory aid, they did not see it as a useful tool in the provision of scheduling assistance in short-term rehabilitation services.

A Research in Real Time Scheduling Policy for Embedded System Domain

Scheduling a sequence of jobs released over time when the processing time of a job is only known
 at its completion is a classical problem in CPU scheduling in time sharing and real time operating
 systems. Previous approaches to scheduling computer systems have focused primarily on systemlevel
 abstractions for the scheduling decision functions or for the mechanisms that are used to
 implement them. This paper introduces a new scheduling concept New Multi Level Feedback
 Queue (NMLFQ) algorithm. It’s important to get a good response time with interactive tasks
 while keeping other tasks from starvation. In this research paper, we prove that a New version of
 the Multilevel Feedback queue algorithm is competitive for single machine system, in our opinion
 providing theoretical validation of the goodness of the idea that has proven effective in practice.

MC-Fluid: Multi-Core Fluid-Based Mixed-Criticality Scheduling

Owing to growing complexity and scale, safety-critical real-time systems are generally designed using the concept of mixed-criticality, wherein applications with different criticality or importance levels are hosted on the same hardware platform. To guarantee non-interference between these applications, the hardware resources, in particular the processor, are statically partitioned among them. To overcome the inefficiencies in resource utilization of such a static scheme, the concept of mixed-criticality real-time scheduling has emerged as a promising solution. Although there are several studies on such scheduling strategies for uniprocessor platforms, the problem of efficient scheduling for the multiprocessor case has largely remained open. In this work, we design a fluid-model based mixed-criticality scheduling algorithm for multiprocessors, in which multiple tasks are allowed to execute on the same processor simultaneously. We derive an exact schedulability test for this algorithm, and also present an optimal strategy for assigning the fractional execution rates to tasks. Since fluid-model based scheduling is not implementable on real hardware, we also present a transformation algorithm from fluid-schedule to a non-fluid one. We also show through experimental evaluation that the designed algorithms outperform existing scheduling algorithms in terms of their ability to schedule a variety of task systems.

DMS Workflows Scheduling Concepts Comparison

The development of computational and communication technology enabled an introduction of a Distribution Management System (DMS) as a sophisticated approach to solve various problems regarding the power supply in modern society. These advanced systems execute a large number of workflows to meet requirements and provide desirable functionalities. Very high demands for computational resources during the DMS operation, imposed a necessity for an adequate DMS workflow management. Three DMS workflow scheduling concepts (architectures) are presented in this paper: centralized, mixed and hierarchical. These scheduling concepts are compared by different parameters such as performance, scalability and complexity of implementation. The conducted experimental study showed that the hierarchical scheduling concept not only provides the best performance, but also is the most scalable and entirely eligible in terms of implementation complexity. DOI: http://dx.doi.org/10.5755/j01.itc.47.1.18062

Contention-aware lock scheduling for transactional databases

Lock managers are among the most studied components in concurrency control and transactional systems. However, one question seems to have been generally overlooked: "When there are multiple lock requests on the same object, which one(s) should be granted first?"Nearly all existing systems rely on a FIFO (first in, first out) strategy to decide which transaction(s) to grant the lock to. In this paper, however, we show that the lock scheduling choices have significant ramifications on the overall performance of a transactional system. Despite the large body of research on job scheduling outside the database context, lock scheduling presents subtle but challenging requirements that render existing results on scheduling inapt for a transactional database. By carefully studying this problem, we present the concept of contention-aware scheduling, show the hardness of the problem, and propose novel lock scheduling algorithms (LDSF and bLDSF), which guarantee a constant factor approximation of the best scheduling. We conduct extensive experiments using a popular database on both TPC-C and a microbenchmark. Compared to FIFO---the default scheduler in most database systems---our bLDSF algorithm yields up to 300x speedup in overall transaction latency. Alternatively, our LDSF algorithm, which is simpler and achieves comparable performance to bLDSF, has already been adopted by open-source community, and was chosen as the default scheduling strategy in MySQL 8.0.3+

On a versatile scheduling concept of maintenance activities for increased availability of production resources

Manufacturing systems are making a shift towards intelligent and predictive Cyber Physical Systems (CPS) with enhanced sensing and communication capabilities. Current maintenance activities are based on predefined schedules, without considering the working state of the equipment and thus leading to over-maintained machinery. The cost related to the production process interruption and for dispatching maintenance personnel to restore the equipment to proper working conditions is high.In this context, this study presents an extendable and re-usable scheduling approach supporting multiple heterogeneous inputs and outputs. Predictive maintenance indicators from the monitored equipment are used for scheduling maintenance operations in line with the existing schedule. A web-service architecture is adopted towards supporting highly different use-cases, such as equipment providers and/or manufacturers. The incorporation of maintenance activities to the production schedule may result in a reduction of maintenance breakdowns and thus increased productivity. The proposed approach has been applied to cases deriving from the automotive and steel production industries.

Pengelolaan Supervisi Pembelajaran Berbasis Kurikulum 2013 di SMK

The purposes of this study are: (1) Describing the supervision planning of learningbased on Curriculum 2013 in SMK Pancasila 3 Baturetno Wonogiri Regency. (2)Describing the supervision implementation of learning based on Curriculum 2013in SMK Pancasila 3 Baturetno Wonogiri Regency. (3) Describing the evaluation andfollow-up of supervision of learning based on Curriculum 2013 in SMK Pancasila3 Baturetno Wonogiri Regency. The Type of the research is qualitative research withphenomenological design which conducted in SMK Pancasila 3 Baturetno. Thetechniques data collection with in-depth interviews, observation and documentation.Data analysis using descriptive - qualitative analysis model.The results of the study are : (1) Supervision activity of learning at SMK Pancasila3 Baturetno conducted by good planning. The principal and the vice principal ofcurriculum make a concept of supervision schedule according to applicable scheduleand List Sort Rank (DUK). Then, this concept is coordinated to all teachers as a meansof information about the supervision activity of learning and its schedule. Threeaspects which supervised by principal are instructional administration, learningimplementation and assessment administration. (2) Supervision of learning is doneby observation technique. The principal supervises the class based on the schedule.The assessment is set out in a supervisory instrument and principal’s notebook in theform of scores and descriptions. (3) The evaluation of supervision is conducted afterthe supervised teacher has no teaching duty. The evaluation discusses the resultsof supervision, especially the strength and weaknesses of the supervised teachingin carrying out teaching and learning duties. In general, the results of supervisionsummarized from supervision evaluation activities showing that teachers of SMKPancasila 3 Baturetno are completed in administration, competent in deliveringlessons and completed in assessment administration. However, there are someteachers still having different perceptions in understanding the implementation ofthe Curriculum 2013. Therefore, the principal facilitates to hold MGMP and IHT asa follow-up of supervision.

Priority Scheduling in the Planning of Multiple-Structure Construction Projects

AbstractThe paper presents a method of priority scheduling that is useful during the planning of multiple-structure construction projects. This approach is an extension of the concept of interactive scheduling. In priority scheduling, it is the planner that can determine how important each of the technological and organisational constraints are to them. A planner’s preferences can be defined through developing a ranking list that defines which constraints are the most important, and those whose completion can come second. The planner will be able to model the constraints that appear at a construction site more flexibly. The article presents a general linear programming model of the planning of multiple-structure construction projects, as well as various values of each of the parameters that allow us to obtain different planning effects. The proposed model has been implemented in a computer program and its effectiveness has been presented on a calculation example.

Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm

Waste collection widely depends on the route optimization problem that involves a large amount of expenditure in terms of capital, labor, and variable operational costs. Thus, the more waste collection route is optimized, the more reduction in different costs and environmental effect will be. This study proposes a modified particle swarm optimization (PSO) algorithm in a capacitated vehicle-routing problem (CVRP) model to determine the best waste collection and route optimization solutions. In this study, threshold waste level (TWL) and scheduling concepts are applied in the PSO-based CVRP model under different datasets. The obtained results from different datasets show that the proposed algorithmic CVRP model provides the best waste collection and route optimization in terms of travel distance, total waste, waste collection efficiency, and tightness at 70–75% of TWL. The obtained results for 1 week scheduling show that 70% of TWL performs better than all node consideration in terms of collected waste, distance, tightness, efficiency, fuel consumption, and cost. The proposed optimized model can serve as a valuable tool for waste collection and route optimization toward reducing socioeconomic and environmental impacts.

MAKING OF FIELD LEARNING REGISTER AND FIELD OBSERVATION SCHEDULE: THE TOOLS FOR PROCESS MONITORING

In field of monitoring and evaluation, process monitoring is always essential. Process monitoring is necessary in order to ensure the quality and standards of activities. If the activities are not conducted as per standards, then talking about results will be like finding black cat in a dark room. Results are always based on the implementation and quality outputs and proper use of these outputs by the communities. Let suppose, in a project of food and nutrition security if any organization is distributing goats and ME “ if the goats were healthy, if they were weighed and vaccinated at distribution point?” At the end of project evaluation report says that there was no any visible impact on nutrition of beneficiaries with the distribution of goats. The reader of the report will have first the impression that the project impact hypothesis was wrong; “ distribution of goats is not helpful in improvement of food and nutrition security of rural communities ”. However, there can be the possibility that few of the goats died just after distribution and/or few of the goats were over aged to reproduce further. If these could be the possibilities then question raises: where could be these reviewed? And the answer is, when the goats were distributed. To feel the importance of process monitoring, team of Deutsche Welthungerhilfe based at Sindh, Pakistan decided to develop most effective and qualitative tools for process monitoring. Two tools were developed and implemented through partners working in field. One was Field Learning Register (FLR) which is kept in the offices of partners and being used by everyone to write down their learnings during implementation of activities in field. Other tool was checklist for spot checks of activities which was being used online through Akvo-Flow software. Later, on that check list was replaced with Field Observation Schedule (FOS) now it is being used for process monitoring of different activities at the time of implementation. Field learning registers is helping to decide about implementation of project activities and refine the beneficiary criteria. Field observation schedule is helping to shape up the approach of managing and conducting project activities. Concept of field observation schedule was taken from the idea of observation schedule (Bell, 2010). Article visualizations:

Demonstrating Johnson’s algorithm via resource-constrained scheduling

The celebrated Johnson’s algorithm to solve the two-machine flowshop scheduling problem to minimise the makespan plays a prominent role in scheduling research. In using resource-constrained scheduling to interpret Johnson’s algorithm in teaching scheduling theory and operations management, we have received positive student feedback on the perceived intuition. We demonstrate this idea and show that the resource-constrained scheduling concept also helps simplify the proofs of some classical scheduling results.

A CASE Study on Software Project Development Cost, Schedule & Effort Estimation

This paper theme is to provide a case study of Software Project Development cost, effort, and schedule estimation. From recent past, a remarkable research takes place in developing different techniques on software effort and cost estimation. Making estimation before start of any project is necessary to be able to plan and manage any project. The estimate is an intelligent guess for the project resources. Nowadays, software has become a major contributor to economic growth for any nation. Making an estimate before starting any software project is vital for the project managers and key stakeholders. Major project milestones such as project schedules, budgeting, resource allocation, and project delivery dates are set on theeffort and cost estimates. Thus, the reliability of the estimation leads any project success or otherwise fail. In this article, author’s idea is to work with function point analysis and include the concept of workforce scheduling in a better way while taking the decision in the contract phase. That leads to strengthening the relations between the developer and the customer. Basically, size is a main measured unit of the software project. Based on the size and other functionalities, the software managers estimate the total effort required to develop the project. From the effort and work schedule, the total cost can be estimated.

Analisis Penjadwalan Kegiatan Produksi pada PT. Muliaglass Float Division dengan Metode Forward dan Backward Scheduling

Carry out the work effectively and efficiently to the desired goal is achieved by all the company's management. Therefore an understanding of the concept of scheduling is very important, so that the practitioner should know when starting a job and when it ended. Scheduling is an important activity within the company. The technique used depends on production volume, product variations, operating conditions, and the complexity of the work itself. Regardless of the type of company, every company needs to do the scheduling as possible in order to obtain maximum utility from resource production. Keywords: Scheduling, Production, Planning

Stochastic and Deterministic Unit Commitment Considering Uncertainty and Variability Reserves for High Renewable Integration

The uncertain and variable nature of renewable energy sources in modern power systems raises significant challenges in achieving the dual objective of reliable and economically efficient system operation. To address these challenges, advanced scheduling strategies have evolved during the past years, including the co-optimization of energy and reserves under deterministic or stochastic Unit Commitment (UC) modeling frameworks. This paper presents different deterministic and stochastic day-ahead UC formulations, with focus on the determination, allocation and deployment of reserves. An explicit distinction is proposed between the uncertainty and the variability reserve, capturing the twofold nature of renewable generation. The concept of multi-timing scheduling is proposed and applied in all UC policies, which allows for the optimal procurement of such reserves based on intra-hourly (real-time) intervals, when concurrently optimizing energy and commitments over hourly intervals. The day-ahead scheduling results are tested against different real-time dispatch regimes, with none or limited look-ahead capability, or with the use of the variability reserve, utilizing a modified version of the Greek power system. The results demonstrate the enhanced reliability achieved by applying the multi-timing scheduling concept and explicitly considering the variability reserve, and certain features regarding the allocation and deployment of reserves are discussed.

Representing and scheduling procedural generation using operator graphs

In this paper, we present the concept of operator graph scheduling for high performance procedural generation on the graphics processing unit (GPU). The operator graph forms an intermediate representation that describes all possible operations and objects that can arise during a specific procedural generation. While previous methods have focused on parallelizing a specific procedural approach, the operator graph is applicable to all procedural generation methods that can be described by a graph, such as L-systems, shape grammars, or stack based generation methods. Using the operator graph, we show that all partitions of the graph correspond to possible ways of scheduling a procedural generation on the GPU, including the scheduling strategies of previous work. As the space of possible partitions is very large, we describe three search heuristics, aiding an optimizer in finding the fastest valid schedule for any given operator graph. The best partitions found by our optimizer increase performance of 8 to 30x over the previous state of the art in GPU shape grammar and L-system generation.

Efficient Cloud Server Job Scheduling using NN and ABC in cloud computing

High work load not only translates to high operational cost, which reduces the marginal profit of Cloud- providers, which also direct towards low throughput of system. Henceforth, efficient job execution solutions are required to minimize the impact of Cloud computing on the environment. So, to generate such solutions, deep analysis of Cloud is obligatory with regard to their job-efficiency. Otherwise, Cloud computing with progressively persistent front-end client- devices interrelating with back-end data centers will cause an enormous load of jobs. To address this problem, data centre servers need to be managed in an efficient manner to drive computing. In proposed work, hybrid algorithm which is based on neural network with artificial bee colony and some concepts of scheduling has been introduced in work. On the basis of them, tasks execution will be enhanced and load will be reduced. The results evaluation will be done on the basis of total jobs completed in the MATLAB 2010a environment.