Literatura académica sobre el tema "Scheduling of Unreliable Jobs"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Scheduling of Unreliable Jobs".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Scheduling of Unreliable Jobs"
Naseera, Shaik. "Dynamic Job Scheduling Strategy for Unreliable Nodes in a Volunteer Desktop Grid". International Journal of Grid and High Performance Computing 8, n.º 4 (octubre de 2016): 21–33. http://dx.doi.org/10.4018/ijghpc.2016100102.
Texto completoAgnetis, Alessandro, Paolo Detti y Marco Pranzo. "The list scheduling algorithm for scheduling unreliable jobs on two parallel machines". Discrete Applied Mathematics 165 (marzo de 2014): 2–11. http://dx.doi.org/10.1016/j.dam.2012.09.014.
Texto completoRaza, Zahid y Deo P. Vidyarthi. "Reliability Based Scheduling Model (RSM) for Computational Grids". International Journal of Distributed Systems and Technologies 2, n.º 2 (abril de 2011): 20–37. http://dx.doi.org/10.4018/jdst.2011040102.
Texto completoKaid, Husam, Abdulrahman Al-Ahmari, Adel Al-Shayea, Emad Abouel Nasr, Ali K. Kamrani y Haitham A. Mahmoud. "Metaheuristics for optimizing unrelated parallel machines scheduling with unreliable resources to minimize makespan". Advances in Mechanical Engineering 14, n.º 5 (mayo de 2022): 168781322210970. http://dx.doi.org/10.1177/16878132221097023.
Texto completoNANDAGOPAL, MALARVIZHI, S. GAJALAKSHMI y V. RHYMEND UTHARIARAJ. "SCHEDULING WITH JOB CHECKPOINT IN COMPUTATIONAL GRID ENVIRONMENT". International Journal of Modeling, Simulation, and Scientific Computing 02, n.º 03 (septiembre de 2011): 299–316. http://dx.doi.org/10.1142/s1793962311000517.
Texto completoAgnetis, Alessandro y Thomas Lidbetter. "The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines". Operations Research Letters 48, n.º 4 (julio de 2020): 405–9. http://dx.doi.org/10.1016/j.orl.2020.05.006.
Texto completoLee, Jonghyuk, Sungjin Choi, Taeweon Suh y Heonchang Yu. "Mobility-aware balanced scheduling algorithm in mobile Grid based on mobile agent". Knowledge Engineering Review 29, n.º 4 (septiembre de 2014): 409–32. http://dx.doi.org/10.1017/s0269888914000149.
Texto completoAgnetis, Alessandro, Paolo Detti, Marco Pranzo y Manbir S. Sodhi. "Sequencing unreliable jobs on parallel machines". Journal of Scheduling 12, n.º 1 (19 de julio de 2008): 45–54. http://dx.doi.org/10.1007/s10951-008-0076-6.
Texto completoBodlaender, Hans L., Klaus Jansen y Gerhard J. Woeginger. "Scheduling with incompatible jobs". Discrete Applied Mathematics 55, n.º 3 (diciembre de 1994): 219–32. http://dx.doi.org/10.1016/0166-218x(94)90009-4.
Texto completoWang, Kai, Vincent Chau y Minming Li. "Scheduling fully parallel jobs". Journal of Scheduling 21, n.º 6 (16 de abril de 2018): 619–31. http://dx.doi.org/10.1007/s10951-018-0563-3.
Texto completoTesis sobre el tema "Scheduling of Unreliable Jobs"
Mario, Benini. "Improving Decision Making in Real-world Applications by Solving Combinatorial Optimization Problems". Doctoral thesis, Università di Siena, 2022. https://hdl.handle.net/11365/1221594.
Texto completoSong, Bin 1970. "Scheduling adaptively parallel jobs". Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/50354.
Texto completoHan, Kai. "Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems". Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/26917.
Texto completoPh. D.
Ramachandra, Girish. "Scheduling Precedence Related Jobs on Identical Parallel Processors". NCSU, 2002. http://www.lib.ncsu.edu/theses/available/etd-20020121-185145.
Texto completoThe problem of concern to us in this thesis is the scheduling ofprecedence-related jobs non-preemptively on two identical parallelprocessors to minimize the sum of the weighted completion times. The problemis known to be NP-hard.We develop, in chapter 2, a binary integer program which iscapable of solving only small size problems (no larger than 12jobs) to optimality at the present time. We also present a linearprogramming(LP) model adopted from the literature todetermine the lower bound on the optimum. This LP stands us ingood stead when we perform the optimization via the GeneticAlgorithm approach (which is the subject matter of chapter 3). Wealso present a dynamic programming formulation based on theapproach used for solving the "weighted earliness-tardiness"problem. Although DP expands somewhat the size of the problemsthat can be solved to optimality, its computing burden becomesonerous for more than 25 jobs.In an attempt to solve larger, and more realistic problems, a GeneticAlgorithm(GA) is presented in chapter 3. The salient feature of the GAmodel is that the "initial population" of trial solutions are not allrandomly generated but are constituted from a set of priority rules whichare known to be "good" relaxation (in the sense of being "close" to theoptimum) of the original problem. Also, generation of infeasible solutionsis avoided by the use of post-processing procedures after crossover andmutation operations. Computational results show that the GA approach arrivesto within 20% of the lower bound (and hence of the optimum) in very fewiterations.
Simonneau, Nicolas. "Hybrid flow shop scheduling with prescription constraints on jobs". Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/9659.
Texto completoMaster of Science
Yeleswarapu, Radhika M. "Scheduling Of 2-Operation Jobs On A Single Machine To Minimize The Number Of Tardy Jobs". [Tampa, Fla.] : University of South Florida, 2003. http://purl.fcla.edu/fcla/etd/SFE0000216.
Texto completoCutler, Mark Christopher. "A study of scheduling operations with preemptive jobs and global system interruptions /". Thesis, Connect to this title online; UW restricted, 1998. http://hdl.handle.net/1773/8729.
Texto completoSpegal, Christopher S. "Unrelated Machine Scheduling with Deteriorating Jobs and Non-zero Ready Times". Ohio University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou154672272196773.
Texto completoGangammanavar, Harshavardhana J. "OPTIMAL CODING AND SCHEDULING TECHNIQUES FOR BROADCASTING DEADLINE CONSTRAINT TRAFFIC OVER UNRELIABLE WIRELESS CHANNELS". The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1262111942.
Texto completoKorkmaz, Gediz. "Batch Scheduling Of Incompatible Jobs On A Single Reactor With Dynamic Arrivals". Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605096/index.pdf.
Texto completoLibros sobre el tema "Scheduling of Unreliable Jobs"
Liu, Jane W. S. Scheduling real-time, periodic jobs using imprecise results. [Washington, DC?: National Aeronautics and Space Administration, 1987.
Buscar texto completoLiu, Jane W. S. Scheduling real-time, periodic jobs using imprecise results. [Washington, DC?: National Aeronautics and Space Administration, 1987.
Buscar texto completoSeitz, Thomas. High-level scheduling of parallel jobs in the IBM 3090 production environment. Ithaca, N.Y: Cornell Theory Center, Cornell University, 1991.
Buscar texto completoFoulds, L. R. A crash analysis of scheduling to minimize the number of late jobs. Loughborough: Loughborough University Business School, 1993.
Buscar texto completoIndian Institute of Management, Ahmedabad., ed. Scheduling partially ordered jobs under resource constraints to optimize non-regular performance measures. Ahmedabad: Indian Institute of Management, 2003.
Buscar texto completoKumar, Anurag. Performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system. Bangalore: Dept. of Electrical Communication Engineering, Indian Institute of Science, 1990.
Buscar texto completoYuk, Lin Ka. Scheduling two-phase jobs with arbitrary time lags in a single-server system. Birmingham: University of Birmingham, 1994.
Buscar texto completoSarkar, Prabir Kumar. Scheduling of n jobs on one machine for a non-regular measure of performance. Ottawa: National Library of Canada, 1990.
Buscar texto completoS, Liu Jane W., Lin Kwei-Jay y United States. National Aeronautics and Space Administration., eds. Scheduling periodic jobs using imprecise results: By Jen-Yao Chung, Jane W.S. Liu, [and] Kwei-Jay Lin. [Washington, DC: National Aeronautics and Space Administration, 1989.
Buscar texto completoInc, ebrary, ed. Mastering Oracle Scheduler in Oracle 11g databases: Schedule, manage, and execute jobs that automate your business processes. Birmingham, U.K: Packt Publishing Ltd., 2009.
Buscar texto completoCapítulos de libros sobre el tema "Scheduling of Unreliable Jobs"
Mucchetti, Mark. "Scheduling Jobs". En BigQuery for Data Warehousing, 209–30. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-6186-6_10.
Texto completoBodlaender, Hans L., Klaus Jansen y Gerhard J. Woeginger. "Scheduling with incompatible jobs". En Graph-Theoretic Concepts in Computer Science, 37–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56402-0_34.
Texto completoTamir, Tami. "Scheduling with Bully Selfish Jobs". En Lecture Notes in Computer Science, 355–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13122-6_34.
Texto completoBoyar, Joan y Lene M. Favrholdt. "Scheduling Jobs on Grid Processors". En Algorithm Theory – SWAT 2006, 17–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11785293_5.
Texto completoBougeret, Marin, Pierre Francois Dutot, Klaus Jansen, Christina Robenek y Denis Trystram. "Scheduling Jobs on Heterogeneous Platforms". En Lecture Notes in Computer Science, 271–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22685-4_25.
Texto completoAbed, Fidaa, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter y Roman Rischke. "Scheduling Maintenance Jobs in Networks". En Lecture Notes in Computer Science, 19–30. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-57586-5_3.
Texto completoLiberatore, Vincenzo. "Scheduling Jobs Before Shut-Down". En Algorithm Theory - SWAT 2000, 175–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44985-x_16.
Texto completoShih, Chi-sheng, Jane W. S. Liu y Infan Kuok Cheong. "Scheduling Jobs with Multiple Feasible Intervals". En Real-Time and Embedded Computing Systems and Applications, 53–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24686-2_4.
Texto completoBampis, Evripidis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis y Georgios Zois. "Energy Efficient Scheduling of MapReduce Jobs". En Lecture Notes in Computer Science, 198–209. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09873-9_17.
Texto completoBachman, Aleksander y Adam Janiak. "Scheduling Deteriorating Jobs with Ready Times". En Operations Research Proceedings 1999, 342–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-642-58300-1_52.
Texto completoActas de conferencias sobre el tema "Scheduling of Unreliable Jobs"
Hsu, Yu-Pin, Yu-Chih Huang y Shin-Lin Shieh. "Scheduling Stochastic Real-Time Jobs In Unreliable Workers". En 2020 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2020. http://dx.doi.org/10.1109/wcnc45663.2020.9120733.
Texto completoShokripour, Amin y Mohamed Othman. "Scheduling Jobs in a Heterogeneous System with Unreliable Network Links by DLT". En 2010 Second International Conference on Communication Software and Networks. IEEE, 2010. http://dx.doi.org/10.1109/iccsn.2010.114.
Texto completoChang, Ruay-Shiung, Chih-Yuan Lin y Chun-Fu Lin. "Scheduling Jobs in Grids Adaptively". En 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications. IEEE, 2009. http://dx.doi.org/10.1109/ispa.2009.75.
Texto completoWang, Qing, Ying Chen y Min Huang. "Hybrid flow shop scheduling of new arrival jobs and locked jobs". En 2021 33rd Chinese Control and Decision Conference (CCDC). IEEE, 2021. http://dx.doi.org/10.1109/ccdc52312.2021.9602295.
Texto completoHenzinger, Thomas A., Vasu Singh, Thomas Wies y Damien Zufferey. "Scheduling large jobs by abstraction refinement". En the sixth conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1966445.1966476.
Texto completoFrank, Werner,. "Scheduling Jobs with Equal Processing Times". En Information Control Problems in Manufacturing, editado por Bakhtadze, Natalia, chair Dolgui, Alexandre y Bakhtadze, Natalia. Elsevier, 2009. http://dx.doi.org/10.3182/20090603-3-ru-2001.00210.
Texto completoCarvalho, Renata M., Ricardo M. F. Lima, Adriano L. I. Oliveira y Felix C. G. Santos. "Scheduling parallel jobs for multiphysics simulators". En 2010 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2010. http://dx.doi.org/10.1109/cec.2010.5586180.
Texto completoFox, Kyle, Sungjin Im y Benjamin Moseley. "Energy Efficient Scheduling of Parallelizable Jobs". En Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.68.
Texto completoHung, Chien-Chun, Leana Golubchik y Minlan Yu. "Scheduling jobs across geo-distributed datacenters". En SoCC '15: ACM Symposium on Cloud Computing. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2806777.2806780.
Texto completoRoci, Albana y Reggie Davidrajuh. "Scheduling Jobs in Multi-grid Environment". En 2018 UKSim-AMSS 20th International Conference on Computer Modelling and Simulation (UKSim). IEEE, 2018. http://dx.doi.org/10.1109/uksim.2018.00024.
Texto completo