89,258 resources related to Scheduling
- Topics related to Scheduling
- IEEE Organizations related to Scheduling
- Conferences related to Scheduling
- Periodicals related to Scheduling
- Most published Xplore authors for Scheduling
ICC 2021 - IEEE International Conference on Communications
IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.
All fields of satellite, airborne and ground remote sensing.
IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.
The world's premier EDA and semiconductor design conference and exhibition. DAC features over 60 sessions on design methodologies and EDA tool developments, keynotes, panels, plus the NEW User Track presentations. A diverse worldwide community representing more than 1,000 organizations attends each year, from system designers and architects, logic and circuit designers, validation engineers, CAD managers, senior managers and executives to researchers and academicians from leading universities.
IEEE International Conference on Plasma Science (ICOPS) is an annual conference coordinated by the Plasma Science and Application Committee (PSAC) of the IEEE Nuclear & Plasma Sciences Society.
The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...
Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.
Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)
IEEE Communications Magazine was the number three most-cited journal in telecommunications and the number eighteen cited journal in electrical and electronics engineering in 2004, according to the annual Journal Citation Report (2004 edition) published by the Institute for Scientific Information. Read more at http://www.ieee.org/products/citations.html. This magazine covers all areas of communications such as lightwave telecommunications, high-speed data communications, personal communications ...
Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...
2006 6th World Congress on Intelligent Control and Automation, 2006
Dynamic job shop scheduling is a frequently occurring and highly relevant problem in practical fuzzy manufacture environment. Previous research suggested that periodic rescheduling improves classical measures of efficiency; however, this strategy had the undesirable effect of compromising stability and this lack of stability could render even the most efficient rescheduling strategy useless on the shop floor. In this research, the ...
IEE Colloquium on Resource Scheduling for Large Scale Planning Systems, 1993
IEE Colloquium on Advanced Software Technologies for Scheduling, 1993
2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT), 2014
 Sequencing is the process of defining the order in which the set of jobs to be completed are done. Scheduling is the process of adding start and finish information to the job order dictated by the sequence. There are 5 basic types of scheduling: Single Machine Scheduling; Parallel Machine Scheduling; Open Shop Scheduling; Flow Shop Scheduling; and Job Shop ...
2006 6th World Congress on Intelligent Control and Automation, 2006
Scheduling small satellite's mission must meet with two acquirements: one is that all real-time tasks must be complemented in time limit, the other is that it must have fault-tolerant capability. In this paper, an integration mission model of both periodical mission and non-periodical mission is built based on the characteristic of small satellite mission and a fault-tolerant scheduling algorithm of ...
Genetic Programming Hyper-heuristics for Combinatorial Optimisation: Yi Mei CIS Webinar
Switching, Routing & Forwarding: Technical Session 1 - HPSR 2020 Virtual Conference
Some Recent Work in Computational Intelligence for Software Engineering
Challenging the stigma surrounding the role of women in technology, a journey from combinatorial optimization to IBM
IEEE Themes - Efficient networking services underpin social networks
Network Applications & Architectures: Technical Session 4 - HPSR 2020 Virtual Conference
Implantable Wireless Medical Devices and Systems
Dynamic job shop scheduling is a frequently occurring and highly relevant problem in practical fuzzy manufacture environment. Previous research suggested that periodic rescheduling improves classical measures of efficiency; however, this strategy had the undesirable effect of compromising stability and this lack of stability could render even the most efficient rescheduling strategy useless on the shop floor. In this research, the concept of the virtual scheduling pool was proposed and the heuristic virtual dynamic scheduling algorithm was also presented on the basis of this concept. This algorithm allows efficiency and stability to be balanced in a way that is appropriate for each situation. The contradistinctive simulations between the algorithm presented in this paper and the one based on the strategy of the temporal decomposition show that the algorithm presented is effective and feasible as well as the scheduling strategy of the former excels of the later in performance measures as a whole
 Sequencing is the process of defining the order in which the set of jobs to be completed are done. Scheduling is the process of adding start and finish information to the job order dictated by the sequence. There are 5 basic types of scheduling: Single Machine Scheduling; Parallel Machine Scheduling; Open Shop Scheduling; Flow Shop Scheduling; and Job Shop Scheduling. This paper is about the implementation of the algorithms for these basic scheduling and types and developing heuristic approaches to more complex scheduling problems.  A heuristic is an algorithm which tries but not guarantees to find the optimum solution but gives good results for NP-hard or NP-complete problems. NP means non-deterministically polynomial time.
Scheduling small satellite's mission must meet with two acquirements: one is that all real-time tasks must be complemented in time limit, the other is that it must have fault-tolerant capability. In this paper, an integration mission model of both periodical mission and non-periodical mission is built based on the characteristic of small satellite mission and a fault-tolerant scheduling algorithm of static scheduling and dynamic adjustment for small satellite is presented combined with mission allocate algorithm and partial dynamic scheduling algorithm of embedded processor. This algorithm combines both the technique of primary/backup copies and the Hopfield algorithm and sum up static assignment to planning and operation problem held in resource and time. Neural network algorithm is used in partial dynamic adjustment of non- periodical mission and backup mission copies that assures the reliability and temporal effectiveness of mission execution. Simulation results show that it achieves higher schedulability compared to some other methods. Further, in terms of scheduling length and load balancing, it is superior to that of conventional graphic algorithm
Based on the workshop production scheduling, single resource scheduling is formerly researched, but actually multi-resources scheduling is often applied. Aiming at the workshop production resource scheduling, a maxed genetic algorithm to solve the problem of the single resource dynamic Job-Shop scheduling is used and implement workshop multi-resource dynamic Job-Shop scheduling. The Job-Shop multi-resources scheduling is realized by this method and gotten good results by example simulation.
This paper gives overview of two modern approaches to enterprise resources scheduling problem: continuous time problem setting that leads to a combinatorial set of classical linear programming models and discrete time approach that gives an integer programming model. We follow the main steps of problem formulating and find decision points where the researcher chooses which model and computational method to apply. The main objective of this research is to compare both approaches from the computational complexity point of view. We consider several special cases of mass and individual manufacturing and define which approach is more applicable for each of them. In practice this advice can be used in particular cases to reduce hardware requirements to the enterprise resource planning (ERP) system and in certain cases can help improve its performance avoiding implementing big data techniques.
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.
Multiprogramming computer systems execute multiple programs concurrently. An objective of multiprogramming is to optimize resource utilization. Efficient resource utilization is achieved by sharing system resources amongst multiple users and system processes. Optimum resource sharing depends on the efficient scheduling of competing users and system processes for the processor, which renders process scheduling an important aspect of a multiprogramming operating system. As the processor is the most important resource, process scheduling, which is called CPU scheduling, becomes all the more important in achieving the above mentioned objectives. Many algorithms have been developed for the CPU scheduling of a modern multiprogramming operating system. Our research work involves the design and development of new CPU scheduling algorithms (the hybrid scheduling algorithm and the dual queue scheduling algorithm) with a view to optimization. This work involves a software tool which produces a comprehensive simulation of a number of CPU scheduling algorithms. The tool's results are in the form of scheduling performance metrics.
This paper summarizes the recent researches on uncertain project scheduling problems. The literatures of the proactive project scheduling problems are presented firstly. Then we review the achievements of the reactive project scheduling problems. According to the methods of dealing with uncertain information, the developments of the stochastic project scheduling problems and the fuzzy project scheduling problems are described respectively. Ultimately, the paper is sumed up and the directions for further research in this field are indicated.
his standard revises and enhances the VHDL language reference manual (LRM) by including a standard C language interface specification; specifications from previously separate, but related, standards IEEE Std 1164 -1993,1 IEEE Std 1076.2 -1996, and IEEE Std 1076.3-1997; and general language enhancements in the areas of design and verification of electronic systems.
This document is part of the POSIX series of standards for applications and user interfaces to open systems. It defines the Ada language bindings as package specifications and accompanying textual descriptions of the applications program interface (API). This standard supports application portability at the source code level through the binding between ISO 8652:1995 (Ada) and ISO/IEC 9945-1:1990 (IEEE Std 1003.1-1990 ...