Bibliografie tematiche / Scheduling

Letteratura scientifica selezionata sul tema "Scheduling"

Autore: Grafiati
Pubblicato: 4 giugno 2021
Ultima modifica: 28 luglio 2024

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Indice

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Scheduling".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Scheduling"

1

Fithri, Prima, e Fitri Ramawinta. "Penjadwalan Mesin dengan Menggunakan Algoritma Pembangkitan Jadwal Aktif dan Algoritma Penjadwalan Non-Delay untuk Produk Hydrotiller dan Hammermil pada CV. Cherry Sarana Agro". Jurnal Optimasi Sistem Industri 12, n. 2 (25 aprile 2016): 377. http://dx.doi.org/10.25077/josi.v12.n2.p377-399.2013.

Testo completo
Abstract (sommario):
Fulfillment of all demands of consumers who come to the product is one thing that always wanted to be achieved by a company. These requests are not independent of the company's ability to manufacture certain products. CV Cherry Sarana Agro manufactures a wide range of agricultural equipment, one of which is the product hydrotiller and hammermil. Demand for both products are always in large numbers for each period, however, the company could not meet the entire demand. One of the main factors that led this small company's production capacity for these two products is not optimal scheduling of machines made by companies, causing many to be a queue on a particular machine so that the total process operating time becomes very large. Scheduling method is used to optimize the scheduling of machines working on the report of this practice is actively scheduling method and the method of non-delay scheduling. The data needed to perform scheduling with both of these methods is the data used machines, data processing operations and data processing time of operation. With these three data, can be compared to the actual scheduling done by the company with the scheduling is done using active scheduling method and the method of non-delay scheduling. The most optimal scheduling is obtained after comparing the three methods used are scheduling using the non-delay scheduling. This method was chosen because the resulting make span is much smaller than the two other methods. This method is well applied in the company because in addition to reducing the total processing time, can also increase production capacity, so that all requests can be met.Keywords: Active schedulling method, non-delay schedulling method, makespan, hydrotiller, hammermil
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Wang, Kui, Bu Han Zhang, Jia Jun Zhai, Wen Shao, Xiao Shan Wu e Cheng Xiong Mao. "Coordination between Short-Term and Real-Time Scheduling Incorporating Wind Power". Advanced Materials Research 512-515 (maggio 2012): 700–703. http://dx.doi.org/10.4028/www.scientific.net/amr.512-515.700.

Testo completo
Abstract (sommario):
Coordination strategies between short-term (e.g., weekly and daily scheduling ) and real-time scheduling in wind power integrated system are disscussed. To cope with the uncertainty of wind power and load demands, weekly and daily rolling schedulings are applied. According to the latest updated prediction results of wind power and load demands, weekly rolling scheduling is applied to revise unit commitment and fuel allocation in remaining hours in a week. Daily rolling scheduling is applied to revise generation scheduling in remaining time in a day. A modified IEEE 118-bus system is applied to test the proposed approach.
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Jin, Wangkai, e Xiangjun Peng. "SLITS: Sparsity-Lightened Intelligent Thread Scheduling". ACM SIGMETRICS Performance Evaluation Review 51, n. 1 (26 giugno 2023): 21–22. http://dx.doi.org/10.1145/3606376.3593568.

Testo completo
Abstract (sommario):
To make the most of hardware resources in multi-core architectures, effective thread scheduling is crucial. To achieve this, various scheduling objectives have been developed, such as reducing hardware resource contention [1, 11], allocating resources evenly for co-running threads [ 5, 6], and following priority-based policies [7]. Current thread scheduling designs can be categorized into two types. The first type involves fixed-rule scheduling1, which does not depend on workload characteristics and cannot meet the needs of different scheduling objectives. The second type takes the scheduling objectives into account by collecting run-time information on threads together with their correlations (e.g., Cache Miss Count [10, 13], Thread IPC [20], dynamic priority requirements like Earliest Deadline First [2 , 8, 17]), and making scheduling decisions based on thread-to-thread interactions. A unified approach to these two types of scheduler designs can be achieved by focusing on Thread-Interaction statistics. To this end, we introduce the Thread-Interaction Matrix (TIM), which stores statistics on thread-to-thread interaction. These statistics can be any type of run-time statistics concerning the thread-to-thread pairs (e.g., Cache Miss Count [10 , 13], Thread IPC [20], dynamic priority requirements like Earliest Deadline First [2 , 8, 17])2. For fixed-rule scheduling, the TIM contains static values as the statistics do not affect the scheduling decisions. Based on the TIM, scheduling policies can be customized by specifying the rules of thread rescheduling, such as reschedule conditions and strategy. Combining the Thread-Interaction Matrix and scheduling policy provides a formalization of existing thread scheduler designs. Therefore, it is essential to design a general scheduler that can be tailored to different scheduling objectives by co-designing the Thread-Interaction Matrix and the scheduling policy in a synergistic manner.
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Kromodihardjo, Sudiyono, e Ergo Swasono Kromodihardjo. "Modeling of Well Service and Workover to Optimize Scheduling of Oil Well Maintenance". Applied Mechanics and Materials 836 (giugno 2016): 311–16. http://dx.doi.org/10.4028/www.scientific.net/amm.836.311.

Testo completo
Abstract (sommario):
Well maintenance (well service and workover) is an operation needed by oil company to guarantee the optimum productionof its oil well.Well maintenance is performed using large equipment called hydraulic workover unit (HWU-Rig) which is available in limited number. Scheduling sequence of the HWU-Rig to do well service must meet the goal of the maintenance that is to minimize the loss of oil well production due to well breakdown. Thus minimizing breakdown time of well with high rate production is a priority. However, scheduling secuence of the HWU-Rig to perform its task for few days ahead become complicated due to the numerous alternatives of secuence to choose. Each alternatives of sequence yields a certain production loss. Arbitrarily scheduling sequence may not yield the goal og minimizing the loss of well production. This research was done by analyzing workover scheduling system and data from Kondur Petroleum such as well location, well production rate, and service time needed to be performed on wells. Algorithm to create schedulling sequence was developed in the research. The algorithm was then implemented in discrete simulation software, and yield the result of absolute global optimal solution, near optimal solution and local optimal solution of the HWU scheduling problem.
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Thenata, Angelina Pramana, e Andhika Galuh Prabawati. "EVALUATION INFORMATION TECHNOLOGY UTILIZATION OF SCHOOL SUBJECT SCHEDULING USING PIECES FRAMEWORK". Jurnal Terapan Teknologi Informasi 2, n. 1 (23 luglio 2018): 53–63. http://dx.doi.org/10.21460/jutei.2018.21.97.

Testo completo
Abstract (sommario):
Abstract— Information technology has been widely used by several aspects, such as in the scope of business, industry, government, education, and service. The use of information technology in various aspects of spatial planning can help in its business process. One of the use of information technology in the field of education is e-learning, scheduling, financial information systems, and others. SMK N 1 Kaliwungu is one of the schools that already utilize information technology, such as Program Scheduling Subject Schedule. The program helps scheduling in its implementation need to be evaluated to improve more accurate objectives. In this study, will be discussed about system scheduling program Lesson using PIECES Framework. The Framework section is one way of ordering systems or applications related to Performance, Information, Economics, Control, Efficiency, Application Services. Theuse of this framework aims to determine theimplementation of scheduling aids program at SMKN1 Kaliwungu works as a support, enabler, ordriver in the utilization of Information Technology. This research using data from interviews,observations on the curriculum and provision ofquestionnaires to 30 teachers SMKN 1 Kaliwungu. The result of the evaluation obtained from this research is the utilization of scheduling aidsprogram can improve the curriculum performance program can improve the curriculum performance and teaching process to be smoothly without anycollision schedule. The results of evaluation in this research can be said that the utilization of auxiliary programscheduling at SMKN 1 Kaliwungu role as an enabler. Keyword ----- Evaluation, Technology Information, PIECESFramework, Schedulling
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Antonova, Anna, Konstantin Aksyonov e Olga Aksyonova. "An Imitation and Heuristic Method for Scheduling with Subcontracted Resources". Mathematics 9, n. 17 (30 agosto 2021): 2098. http://dx.doi.org/10.3390/math9172098.

Testo completo
Abstract (sommario):
A scheduling problem with subcontracted resources is widely spread and is associated with the distribution of limited renewable and non-renewable resources, both own and subcontracted ones based on the work’s due dates and the earliest start time. Scheduling’s goal is to reduce the cost of the subcontracted resources. In the paper, application of a few scheduling methods based on scheduling theory and the optimization algorithm is considered; limitations of these methods’ application are highlighted. It is shown that the use of simulation modeling with heuristic rules for allocation of the renewable resources makes it possible to overcome the identified limitations. A new imitation and heuristic method for solving the assigned scheduling problem is proposed. The comparison of the new method with existing ones in terms of the quality of the found solution and performance of the methods is carried out. A case study is presented that allowed a four-fold reduction of the overall subcontracted resources cost in a real project portfolio.
Gli stili APA, Harvard, Vancouver, ISO e altri
7

hia, M. Sop. "Review on Scheduling-Job Scheduling". International Journal of Engineering Trends and Technology 60, n. 1 (25 giugno 2018): 42–44. http://dx.doi.org/10.14445/22315381/ijett-v60p205.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Wang, Huijun, e Oliver Sinnen. "List-Scheduling versus Cluster-Scheduling". IEEE Transactions on Parallel and Distributed Systems 29, n. 8 (1 agosto 2018): 1736–49. http://dx.doi.org/10.1109/tpds.2018.2808959.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Belmabrouk, Mounira, e Mounir Marrakchi. "Design, analysis and performance evaluation of parallel algorithms for solving triangular linear systems on multicore platforms". RAIRO - Operations Research 55, n. 2 (marzo 2021): 545–59. http://dx.doi.org/10.1051/ro/2021009.

Testo completo
Abstract (sommario):
In this paper, we focus on the schedulings of 2-steps graph with constant task cost obtained when parallelizing algorithm solving a triangular linear system. We present three scheduling approaches having the same least theoretical execution time. The first is designed through solving a 0-1 integer problem by Mixed Integer Programming (MIP), the second is based on the Critical Path Algorithm (CPA) and the third is a particular Column-Oriented Scheduling (COS). The MIP approach experiments were carried out and confirmed that the makespan values of the MIP scheduling coincide with those of the corresponding lower bound already reached. Experimental results of the last two approaches detailing both makespans and efficiencies are presented and show that their practical performances differ though they are theoretically identical. We compare also these results to those of the appropriate procedure into so-called PLASMA library (Parallel Linear Algebra for Scalable Multi-core Architectures).
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Larco, J. A., J. C. Fransoo e V. C. S. Wiers. "Scheduling the scheduling task: a time-management perspective on scheduling". Cognition, Technology & Work 20, n. 1 (28 ottobre 2017): 1–10. http://dx.doi.org/10.1007/s10111-017-0443-1.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Tesi sul tema "Scheduling"

1

Paulus, J. J. "Online scheduling & project scheduling". Enschede : University of Twente [Host], 2009. http://doc.utwente.nl/60453.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Abd, Rahmin Nor Aliza Binti. "Online scheduling in hospital theatre scheduling". Thesis, University of Southampton, 2018. https://eprints.soton.ac.uk/427362/.

Testo completo
Abstract (sommario):
Increasing population across all age groups has contributed to the increasing demand for health care especially those that require surgeries, thus putting more pressure on hospitals. The inability to provide adequate and efficient treatment as a result of resource constraints causes patients to wait longer for treatment. Waiting for treatment due to unavailability of an operating theatre can result in both deteriorating health and inconvenience. It is even more frustrating when the scheduled operation is cancelled because some slots is used for emergency patients or the scheduled operations are longer that planned. When such situation occurs, some patients need to be rescheduled. To resolve this problem, an operating theatre scheduling for emergency and regular patients is considered. We consider the single operating theatre problem across multiple days together with the multiple operating theatres problem on a single day. The aim is to minimise the cost incurred when patients need to be rescheduled as well as ensure minimal delay and rescheduling. We develop a model and design an algorithm to schedule operations for patients, taking into account their urgency. Patients' urgency depends on their respective situation and changes depend on several factors. Tackling the problem of scheduling single operating theatre, we use a heuristic method to provide a starting solution before applying local search and simulating annealing. The schedule is updated daily to take into account variations from planned durations and the arrival of emergency patients. The rescheduling of patients may be necessary. We consider the priority of patients and ensure that top priority patients be considered first in the scheduling and less important patients can be rescheduled if necessary. Under the local search technique, we swap every pair of patients if they satisfy the conditions imposed. After the patients are swapped, we check the total cost of the swap and compare it with the current cost. If the new total cost is less than the current cost, the swap will be finalised. We then consider the next patient until all remaining patients in the list are accounted for and we come out with the new list of schedule. Continuing from that, we utilise simulating annealing technique where we calculate the difference of the total cost (total new cost - total current cost), Δ between a pair of patients that we plan to swap. With this approach, as opposed to the local search procedure, even when the di↵erence of the total cost is positive, swapping might still take place but only with a certain probability. Besides single operating theatre, we also consider the scheduling of multiple operation theatres in a single day. Rather than using the algorithm technique, we propose an integer programming model, the Zero-One Programming model and develop an algorithm that utilises the model in scheduling multiple parallel OTs. If a surgery runs longer that expected or an emergency patient arrived into the system, patients can be moved between the available OTs to ensure that surgeries can still be performed; or if the model decides it is better to reschedule therefore the patients will be rescheduled to the next day. In order to test the efficiency of our models and look at the compatibility of the models with our algorithm, data are generated with different parameters to see if our proposed models have the ability to lower cost as well as prevent delays and rescheduling. Moreover, we check the computational time of our algorithm to ascertain whether it can provide solutions within a short amount of time. Overall, our models show improvement in reducing cost and minimising delay and rescheduling.
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Gould, Rebecca (Rebecca L. ). "Program scheduling : decreasing flow by back-scheduling". Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/104396.

Testo completo
Abstract (sommario):
Thesis: M.B.A., Massachusetts Institute of Technology, Sloan School of Management, 2016. In conjunction with the Leaders for Global Operations Program at MIT.
Thesis: S.M. in Engineering Systems, Massachusetts Institute of Technology, School of Engineering, Institute for Data, Systems, and Society, 2016. In conjunction with the Leaders for Global Operations Program at MIT.
Cataloged from PDF version of thesis.
Includes bibliographical references (page 74).
The Boeing 737 program has announced that they will continue to increase their production rate from 42 airplanes per month to eventually 52 airplanes per month. In order for the field to accommodate the increased production rates, opportunities are being considered for decreasing airplane production flow and the increasing capacity in the field. This thesis focuses on the opportunity for decreasing schedule flow through improvements in the scheduling process. Currently the field constraints do not heavily influence what order the planes roll out of the factory. This causes the field to deal with constraint variation by addressing the airplane schedule flow in order to make delivery. This thesis contributes to focusing on improving the scheduling process by driving more information being shared upstream in the decision making process and therefore decreasing the number of days needed to prepare the airplane for delivery.
by Rebecca Gould.
M.B.A.
S.M. in Engineering Systems
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Lazarević, Aleksandar. "Autonomous grid scheduling using probabilistic job runtime scheduling". Thesis, University College London (University of London), 2008. http://discovery.ucl.ac.uk/7987/.

Testo completo
Abstract (sommario):
Computational Grids are evolving into a global, service-oriented architecture – a universal platform for delivering future computational services to a range of applications of varying complexity and resource requirements. The thesis focuses on developing a new scheduling model for general-purpose, utility clusters based on the concept of user requested job completion deadlines. In such a system, a user would be able to request each job to finish by a certain deadline, and possibly to a certain monetary cost. Implementing deadline scheduling is dependent on the ability to predict the execution time of each queued job, and on an adaptive scheduling algorithm able to use those predictions to maximise deadline adherence. The thesis proposes novel solutions to these two problems and documents their implementation in a largely autonomous and self-managing way. The starting point of the work is an extensive analysis of a representative Grid workload revealing consistent workflow patterns, usage cycles and correlations between the execution times of jobs and its properties commonly collected by the Grid middleware for accounting purposes. An automated approach is proposed to identify these dependencies and use them to partition the highly variable workload into subsets of more consistent and predictable behaviour. A range of time-series forecasting models, applied in this context for the first time, were used to model the job execution times as a function of their historical behaviour and associated properties. Based on the resulting predictions of job runtimes a novel scheduling algorithm is able to estimate the latest job start time necessary to meet the requested deadline and sort the queue accordingly to minimise the amount of deadline overrun. The testing of the proposed approach was done using the actual job trace collected from a production Grid facility. The best performing execution time predictor (the auto-regressive moving average method) coupled to workload partitioning based on three simultaneous job properties returned the median absolute percentage error centroid of only 4.75%. This level of prediction accuracy enabled the proposed deadline scheduling method to reduce the average deadline overrun time ten-fold compared to the benchmark batch scheduler. Overall, the thesis demonstrates that deadline scheduling of computational jobs on the Grid is achievable using statistical forecasting of job execution times based on historical information. The proposed approach is easily implementable, substantially self-managing and better matched to the human workflow making it well suited for implementation in the utility Grids of the future.
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Magalhaes, Marcus Vinicius De Oliveira. "Refinery scheduling". Thesis, Imperial College London, 2004. http://hdl.handle.net/10044/1/8420.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Hoffman, Torrey Luke. "Cache scheduling". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ34489.pdf.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Raman, Rajiv. "Chromatic scheduling". Diss., University of Iowa, 2007. http://ir.uiowa.edu/etd/156.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Huang, Chueng-Chiu S. "Stochastic scheduling". Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24834.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Thorpe, J. C. "Vehicle scheduling". Thesis, University of Manchester, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.488397.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Das, Abhishek. "Stream scheduling /". May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Libri sul tema "Scheduling"

1

Pinedo, Michael L. Scheduling. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Pinedo, Michael L. Scheduling. Boston, MA: Springer US, 2012. http://dx.doi.org/10.1007/978-1-4614-2361-4.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Pinedo, Michael L. Scheduling. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-05921-6.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Brucker, Peter. Scheduling Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Scheduling algorithms. 4a ed. Berlin: Springer, 2004.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Brucker, Peter. Scheduling Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-662-03088-2.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Lopez, Pierre, e Franois Roubellat, a cura di. Production Scheduling. London, UK: ISTE, 2008. http://dx.doi.org/10.1002/9780470611050.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Brucker, Peter. Scheduling Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24804-0.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Brucker, Peter, e Sigrid Knust. Complex Scheduling. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-23929-8.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Węglarz, Jan, a cura di. Project Scheduling. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5533-9.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Più fonti

Capitoli di libri sul tema "Scheduling"

1

Pinedo, Michael L. "Introduction". In Scheduling, 1–10. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_1.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Pinedo, Michael L. "Single Machine Models (Stochastic)". In Scheduling, 265–91. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_10.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Pinedo, Michael L. "Single Machine Models with Release Dates (Stochastic)". In Scheduling, 293–317. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_11.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Pinedo, Michael L. "Parallel Machine Models (Stochastic)". In Scheduling, 319–48. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_12.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Pinedo, Michael L. "Flow Shops, Job Shops and Open Shops (Stochastic)". In Scheduling, 349–72. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_13.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Pinedo, Michael L. "General Purpose Procedures for Deterministic Scheduling". In Scheduling, 375–98. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_14.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Pinedo, Michael L. "More Advanced General Purpose Procedures". In Scheduling, 399–429. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_15.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Pinedo, Michael L. "Modeling and Solving Scheduling Problems in Practice". In Scheduling, 431–58. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_16.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Pinedo, Michael L. "Design and Implementation of Scheduling Systems: Basic Concepts". In Scheduling, 459–83. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_17.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Pinedo, Michael L. "Design and Implementation of Scheduling Systems: More Advanced Concepts". In Scheduling, 485–508. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26580-3_18.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Scheduling"

1

Tate, Daniel, Gordon Steven e Paul Findlay. "Investigating the Relative Performance of Static and Dynamic Instruction Scheduling". In International Symposium on Computer Architecture and High Performance Computing. Sociedade Brasileira de Computação, 1999. http://dx.doi.org/10.5753/sbac-pad.1999.19788.

Testo completo
Abstract (sommario):
There are two distinct groups of research into ILP. Those that strongly favour static instruction scheduling and those that favour dynamic instruction scheduling. This paper introduces powerful static and dynamic scheduling models and combines them within the framework of a single simulation environment. Both individual models achieve respectable speedups; dynamic schedullng significantly out-performs static scheduling when an idealised processor model with perfect branch prediction is used. However, when a realistic branch predictor is substituted, the roles are reversed, and static scheduling achieves the higher performance. Similarly, static scheduling performs better in the absence of branch prediction or when processor resources are restricted. Finally, we combine static scheduling with out-of-order instruction issue. Disappointingly, when an ideal out-of-order processor is used, scheduled code fails to match the performance of unscheduled code. Furthermore, with realistic branch predictlon, out-of-order issue fails to improve the performance of scheduled code.
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Stougie, Leen. "Scheduling over scenarios". In International Workshop on Dynamic Scheduling Problems. Polish Mathematical Society, 2023. http://dx.doi.org/10.14708/isbn.978-83-962157-1-0p21-22.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Uetz, Marc. "Approximation algorithms for scheduling under uncertainty". In Workshop on dynamic scheduling problems. Polish Mathematical Society, 2016. http://dx.doi.org/10.14708/isbn.978-83-937220-7-5p25-28.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Uetz, Marc. "Approximation algorithms for scheduling under uncertainty". In Workshop on dynamic scheduling problems. Polish Mathematical Society, 2016. http://dx.doi.org/10.14708/isbn.978-83-937220-7-5p25-30.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Lin, Bertrand M.-T. "Relocation scheduling with optional recycling operations". In Workshop on dynamic scheduling problems. Polish Mathematical Society, 2016. http://dx.doi.org/10.14708/isbn.978-83-937220-7-5p55-58.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Berlińska, Joanna. "The first international workshop on dynamic scheduling problems". In Workshop on dynamic scheduling problems. Polish Mathematical Society, 2016. http://dx.doi.org/10.14708/isbn.978-83-937220-7-5p31-34.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Kovalyov, Mikhail Y., Xavier Delorme e Alexandre Dolgui. "Workforce planning for cyclic production of multiple parts". In Workshop on dynamic scheduling problems. Polish Mathematical Society, 2016. http://dx.doi.org/10.14708/isbn.978-83-937220-7-5p47-50.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Gawiejnowicz, Stanisław, e Wiesław Kurc. "Solving a time-dependent scheduling problem by interior point method". In Workshop on dynamic scheduling problems. Polish Mathematical Society, 2016. http://dx.doi.org/10.14708/isbn.978-83-937220-7-5p35-38.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Gerstl, Enrique, Baruch Mor e Gur Mosheiov. "Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection". In Workshop on dynamic scheduling problems. Polish Mathematical Society, 2016. http://dx.doi.org/10.14708/isbn.978-83-937220-7-5p39-41.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Kononov, Alexander, e Yulia Kovalenko. "An 'almost-exact' solution to speed scaling scheduling of parallel jobs with preemption". In Workshop on dynamic scheduling problems. Polish Mathematical Society, 2016. http://dx.doi.org/10.14708/isbn.978-83-937220-7-5p43-46.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Rapporti di organizzazioni sul tema "Scheduling"

1

Mattson, Peter, William J. Dally, Scott Rixner, Ujval J. Kapasi e John D. Owens. Communication Scheduling. Fort Belvoir, VA: Defense Technical Information Center, gennaio 2000. http://dx.doi.org/10.21236/ada419623.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Kapasi, Ujval J., Peter Mattson, William J. Dally, John D. Owens e Brian Towles. Stream Scheduling. Fort Belvoir, VA: Defense Technical Information Center, agosto 2000. http://dx.doi.org/10.21236/ada419624.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Castanon, David A., David A. Logan, Dimitri P. Bertsekas e Stephen D. Patek. Planning and Scheduling: Dynamic Assignment and Scheduling with Contingencies. Fort Belvoir, VA: Defense Technical Information Center, marzo 1998. http://dx.doi.org/10.21236/ada342494.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Smith, Stephen F., Marcel A. Becker, Mark A. Derthick e Laurence A. Kramer. Scheduling and Visualization. Fort Belvoir, VA: Defense Technical Information Center, giugno 2004. http://dx.doi.org/10.21236/ada424933.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Curry, Michael, e David A. Castanon. New World Vistas: Planning and Scheduling Planning and Scheduling With Contingencies. Fort Belvoir, VA: Defense Technical Information Center, febbraio 2001. http://dx.doi.org/10.21236/ada388207.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Miller, James C. Scheduling Aircrews 3: Deployment. Fort Belvoir, VA: Defense Technical Information Center, maggio 2005. http://dx.doi.org/10.21236/ada498519.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Daboo, C., e B. Desruisseaux. Scheduling Extensions to CalDAV. RFC Editor, giugno 2012. http://dx.doi.org/10.17487/rfc6638.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Boman, Erik G. LDRD Report: Scheduling Irregular Algorithms. Office of Scientific and Technical Information (OSTI), ottobre 2014. http://dx.doi.org/10.2172/1172906.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Nain, Philippe, Pantelis Tsoucas e Jean Walrand. Interchange Arguments in Stochastic Scheduling. Fort Belvoir, VA: Defense Technical Information Center, novembre 1988. http://dx.doi.org/10.21236/ada454729.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Bhattacharya, Partha P., e Anthony Ephremides. Optimal Scheduling with Strict Deadlines. Fort Belvoir, VA: Defense Technical Information Center, gennaio 1989. http://dx.doi.org/10.21236/ada454731.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Ti possono interessare anche gli elenchi estesi di opere sul tema "Scheduling":
Articoli di riviste Tesi Libri
Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!

Vai alla bibliografia