Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “software scheduling”

Scheduling Software

Peter L. King, Mac Jacob, Noel Peberdy · Productivity Press eBooks · 2023

Cited by 0

Scheduling Software

NASA Technical Reports Server (NASA)

Advanced Scheduling Environment is a software product designed and marketed by AVYX, Inc. to provide scheduling solutions for complex manufacturing environments. It can be adapted to specific scheduling and manufacturing processes and has led to substantial cost savings. The system was originally developed for NASA use in scheduling Space Shuttle flights and satellite activities. AVYX, Inc. is an offshoot of a company formed to provide computer-related services to NASA. TREES-plus, the company's initial product became the programming language for the advanced scheduling environment system.

Cited by 0

Small Salon Scheduling Software

Oct · Zenodo (CERN European Organization for Nuclear Research) · 2021

Best Salon Software, salon pos, spa software, scheduling software, booking system for hair salons and beauty salons with advanced appointment scheduling.

Cited by 0Open access

scheduling software construction industry

Edward, Thomas · Figshare · 2025

: While HayatCMS specializes in care, its flexible scheduling capabilities can be adapted for other industries. It provides the tools for efficient staff allocation and time management.<br>https://www.hayatcms.co.uk/

Cited by 0Open access

Work scheduling software development

Gaoxiang Wang · DR-NTU (Nanyang Technological University) · 2020

The Work Scheduling Software is a phone application which is a shift scheduling system to realize the information of the shift system to improve the quality and efficiency of shift work. The shift scheduling system is a daily management task of many units. A fair and reasonable shift scheduling method is of great significance for mobilizing enthusiasm and improving work efficiency. Nowadays, most companies still use manual methods to complete schedules, which is time-consuming, labour-intensive and error-prone. In most cases, the automated solutions that operations research may provide cannot satisfy the relevant personnel. Hence, my project combines manual and automatic scheduling to provide more efficient schedule work.

Cited by 0

scheduling software construction industry

Edward, Thomas · Figshare · 2025

: While HayatCMS specializes in care, its flexible scheduling capabilities can be adapted for other industries. It provides the tools for efficient staff allocation and time management.<br>https://www.hayatcms.co.uk/

Cited by 0Open access

Scalable network scheduling in software

Said Mohamed Tawfik Issa, Ahmed Mohamed · SMARTech Repository (Georgia Institute of Technology) · 2020

Network scheduling determines the relative ordering and priority of different flows or packets with respect to some ranking function that is mandated by a scheduling policy. It is the core component in many recent innovations to optimize network performance and utilization. The increasing scale of cloud applications is driving the need to scale network scheduling to millions of flows and to apply complex policies. This requires software network stacks to handle a large number of flows, ranked according to operator-defined policies, and going over different types of networks. This dissertation describes three network scheduling systems that allow network operator to deploy scheduling policies efficiently in software, taking into account the diversity of the requirements of modern networks. First, we develop a system that enforces packet shaping, the most basic scheduling policy efficiently at end hosts. The challenge of packet shaping at scale is optimizing the CPU and memory overhead of the rate limiting system. We present a framework that scales to tens of thousands of rate limiting policies and flows per server, built from the synthesis of three key ideas: i) a single queue shaper using time as the basis for releasing packets, ii) fine-grained, just-in-time freeing of resources in higher layers coupled to actual packet departures, and iii) one shaper per CPU core, with lock-free coordination. Second, we develop a system that provides efficient and programmable packet schedulers in software. Unlike non-work-conserving shapers, programmable schedulers are challenging to implement efficiently. We overcome this challenge by exploiting underlying features of packet ranking; namely, packet ranks are integers and, at any point in time, fall within a limited range of values. To support programmability, we introduce novel programming abstractions to express scheduling policies that cannot be captured by current, state-of-the-art scheduler programming models. Third, we propose a single congestion control approach that is designed to handle datacenter LAN traffic and WAN traffic simultaneously. This work is motivated by our observation that customization of congestion control algorithms causes the WAN traffic to negatively impact the performance of the LAN traffic. This customization is based on the differences between WAN and LAN characteristics. However, it overlooks that both types of traffic compete at the near-source bottlenecks where the two types of traffic overlap. We propose deploying two interacting congestion control loops: one handles near-source congestion leveraging local network feedback, while the other handles congestion on the rest of the path using conventional LAN and WAN congestion control schemes.

Cited by 0

Software-Only Value Speculation Scheduling

Chao-ying Fu, Matthew D. Jennings, Sergei Y. Larin et al. · 1998

Recent research in value prediction, including several recent publications for MICRO, shows a surprising amount of predictability for the values produced by register-writing instructions. Several hardware based value predictor designs have been proposed to exploit this predictability by eliminating flow dependencies for highly predictable values. A hardware and software based technique, value speculation scheduling (VSS), combines static instruction level parallelism (ILP) scheduling techniques with dynamic value prediction hardware. This paper extends the previous work on VSS to a software-only based scheme for VSS, which we will call software value speculation scheduling (SVSS). The advantages of SVSS are that no instruction set architecture (ISA) extensions and no value prediction hardware is required. Therefore, SVSS is applicable to existing microarchitectures such as Intel’s P6, Digital’s Alpha, Sun’s UltraSparc and IBM/Motorola’s PowerPC. As with VSS, static ILP scheduling techniques are used for SVSS to speculate value dependent instructions by scheduling them above the instructions whose results they are dependent on. For SVSS, compiler generated instructions are used to produce value predictions in place of the prediction hardware of ∗ Review copy. Do not distribute VSS. These predictions allow the execution of speculated instructions to continue. Again, in the case of miss-predicted values, control flow is redirected to patch-up code so that execution can proceed with the correct results. In this paper, experiments for applying SVSS to select load instructions in the SPECint95 benchmarks are performed. Speedup of up to 8 % has been shown for using SVSS. Empirical results on the software-only value predictability of loads, based on value profiling data, are also provided.

Cited by 0

Deliverable D6.2: Scheduling Software Solution

Shuchen, Liu · Zenodo (CERN European Organization for Nuclear Research) · 2025

The objective of Deliverable D6.2 in the FASTEST project was to develop andimplement a scheduling software solution to optimize battery testing processes.This report documents the design and deployment of a task scheduling algorithmintegrated within the Laboratory Information Management System (LIMS). Theprimary objective of the scheduling algorithm was to ensure efficient allocation ofresources across both virtual and physical test benches, reduce idle time, andminimize delays, thereby enhancing the productivity and cost-effectiveness.

Cited by 0Open access

Software Project Scheduling with Multitasking

Hongbo Li, ZHU HANYU, ZHENG LINWEN et al. · ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH · 2023

In software development projects, employees tend to switch between various tasks within a time period.In addition, the task duration usually depends on the number of the allocated employees and their skill levels.We investigate the software project scheduling problem with multitasking and variable durations (SPSPM).We present a non-linear optimisation model that is then linearised into an equivalent mixed-integer linear programming model.To efficiently solve the NP-hard SPSPM, we design a two-stage priority rule-based heuristic algorithm and an improved genetic algorithm (GA).Extensive computational experiments are conducted on a benchmark dataset consisting of 540 project instances.The parameter settings of the GA are determined based on the Taguchi method for the Design of Experiment.The computational results obtained by comparing our algorithms with the exact solver CPLEX reveal that our GA is effective and competitive.

Cited by 3Open access

Software complex for automated scheduling

Mingazova Guzel · Cvut DSpace (Czech Technical University) · 2018

Diplomová práce se zabývá problematikou generování jízdních řádů. Teorie plánování je již více než 50 let studována a neexistuje jednoznačné řešení plánování, které by splňovalo všechny podmínky, které byly stanoveny. V diplomové práci řešíme problém automatizovaného plánování v ústavu. V práci je prezentován matematický model a tvorba rozvrhu v jednotlivých případech. Ve druhé části byla provedena validace vygenerovaného časového plánu o přítomnosti chyb a souběhů. Třetí část představuje formalizaci organizace ukládání dat ve formátu souborů MS Excel, která obsahuje potřebná data o skupinách, třídách a přednášejících v Ústavu výpočetní matematiky a informačních technologií.

Cited by 0Open access

A software process scheduling simulator

F. Padberg · 25th International Conference on Software Engineering, 2003. Proceedings. · 2003

To cut development cost and meet tight deadlines in short staffed software projects, managers must optimize the project schedule. Scheduling a software project is extremely difficult, though, because the time needed to complete a software development activity is hard to estimate. Often, the completion of a task is delayed because of unanticipated rework caused by feedback between activities in the process.

Cited by 9

Scheduling Software for Complex Scenarios

NASA Technical Reports Server (NASA)

Preparing a vehicle and its payload for a single launch is a complex process that involves thousands of operations. Because the equipment and facilities required to carry out these operations are extremely expensive and limited in number, optimal assignment and efficient use are critically important. Overlapping missions that compete for the same resources, ground rules, safety requirements, and the unique needs of processing vehicles and payloads destined for space impose numerous constraints that, when combined, require advanced scheduling. Traditional scheduling systems use simple algorithms and criteria when selecting activities and assigning resources and times to each activity. Schedules generated by these simple decision rules are, however, frequently far from optimal. To resolve mission-critical scheduling issues and predict possible problem areas, NASA historically relied upon expert human schedulers who used their judgment and experience to determine where things should happen, whether they will happen on time, and whether the requested resources are truly necessary.

Cited by 0

Software project scheduling, software project performance measurement and control

Kanık, Yusuf · OpenMETU (Middle East Technical University) · 2019

This thesis is about software project scheduling and use of earned value method on software projects. As a result of the study, a solution for software project scheduling problems is proposed. A mathematical formulation, developed using integer programming method, is at the heart of the solution. Objective of the formulation is to minimize the development costs consisting of direct labor cost, indirect costs and probable penalty costs. The formulation takes the capability and compatibility variances among resources into account whereas contemporary approaches mostly focus on resource availability. Formulation is of type discrete time and takes the time span to be searched as input. Therefore a heuristic approach has been developed for providing time span input to the models developed using the formulation. The heuristic approach has been proven to be calculating a time span that does not hinder achieving the absolute optimum schedule and shortens the solution time of the integer programs. The heuristic approach and problem formulation have been incorporated into a computer program that generates integer programs and heuristic solutions. This thesis also describes a method for preparing an earned value plan, based on the scheduling solution defined. The method aims to help project managers in determining the status of their projects and deciding whether any corrective action is required or not. Besides the method, approaches for incorporating indirect costs and penalty costs, which are not explicitly discussed in literature, into final cost estimation have been described.

Cited by 0Open access