Log in

Relevant bibliographies by topics / Parallel job / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Parallel job.

Dissertations / Theses on the topic 'Parallel job'

Author: Grafiati

Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Parallel job.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Sabin, Gerald M. "Unfairness in parallel job scheduling." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1164826017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Islam, Mohammad Kamrul. "QoS In Parallel Job Scheduling." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1218566682.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wing, A. J. "Parallel simulation of PCB job shops." Thesis, University of East Anglia, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359342.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lynch, Gerard. "Parallel job scheduling on heterogeneous networks of multiprocessor workstations." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0006/MQ45952.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ali, Syed Zeeshan. "An investigation into parallel job scheduling using service level agreements." Thesis, University of Manchester, 2014. https://www.research.manchester.ac.uk/portal/en/theses/an-investigation-into-parallel-job-scheduling-using-service-level-agreements(f4685321-374e-41c4-86da-d07f09ea4bac).html.

Full text

Abstract:

A scheduler, as a central components of a computing site, aggregates computing resources and is responsible to distribute the incoming load (jobs) between the resources. Under such an environment, the optimum performance of the system against the service level agreement (SLA) based workloads, can be achieved by calculating the priority of SLA bound jobs using integrated heuristic. The SLA defines the service obligations and expectations to use the computational resources. The integrated heuristic is the combination of different SLA terms. It combines the SLA terms with a specific weight for ea

APA, Harvard, Vancouver, ISO, and other styles

6

Li, Jianqing. "A parallel approach for solving a multiple machine job sequencing problem." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ60235.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zhou, Huajun. "The CON Job scheduling problem on a single and parallel machines /." Electronic version (PDF), 2003. http://dl.uncw.edu/etd/2003/zhouh/huajunzhou.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Vélez, Gallego Mario César. "Algorithms for Scheduling Parallel Batch Processing Machines with Non-Identical Job Ready Times." FIU Digital Commons, 2009. http://digitalcommons.fiu.edu/etd/276.

Full text

Abstract:

This research is motivated by a practical application observed at a printed circuit board (PCB) manufacturing facility. After assembly, the PCBs (or jobs) are tested in environmental stress screening (ESS) chambers (or batch processing machines) to detect early failures. Several PCBs can be simultaneously tested as long as the total size of all the PCBs in the batch does not violate the chamber capacity. PCBs from different production lines arrive dynamically to a queue in front of a set of identical ESS chambers, where they are grouped into batches for testing. Each line delivers PCBs that va

APA, Harvard, Vancouver, ISO, and other styles

9

Hulett, Maria. "Analytical Approximations to Predict Performance Measures of Manufacturing Systems with Job Failures and Parallel Processing." FIU Digital Commons, 2010. http://digitalcommons.fiu.edu/etd/167.

Full text

Abstract:

Parallel processing is prevalent in many manufacturing and service systems. Many manufactured products are built and assembled from several components fabricated in parallel lines. An example of this manufacturing system configuration is observed at a manufacturing facility equipped to assemble and test web servers. Characteristics of a typical web server assembly line are: multiple products, job circulation, and paralleling processing. The primary objective of this research was to develop analytical approximations to predict performance measures of manufacturing systems with job failures and

APA, Harvard, Vancouver, ISO, and other styles

10

Khan, Mukhtaj. "Hadoop performance modeling and job optimization for big data analytics." Thesis, Brunel University, 2015. http://bura.brunel.ac.uk/handle/2438/11078.

Full text

Abstract:

Big data has received a momentum from both academia and industry. The MapReduce model has emerged into a major computing model in support of big data analytics. Hadoop, which is an open source implementation of the MapReduce model, has been widely taken up by the community. Cloud service providers such as Amazon EC2 cloud have now supported Hadoop user applications. However, a key challenge is that the cloud service providers do not a have resource provisioning mechanism to satisfy user jobs with deadline requirements. Currently, it is solely the user responsibility to estimate the require amo

APA, Harvard, Vancouver, ISO, and other styles

11

Utrera, Iglesias Gladys Miriam. ""Virtual malleability" applied to MPI jobs to improve their execution in a multiprogrammed environment"." Doctoral thesis, Universitat Politècnica de Catalunya, 2007. http://hdl.handle.net/10803/6013.

Full text

Abstract:

This work focuses on scheduling of MPI jobs when executing in shared-memory multiprocessors (SMPs). <br/>The objective was to obtain the best performance in response time in multiprogrammed multiprocessors systems using batch systems, assuming all the jobs have the same priority. <br/>To achieve that purpose, the benefits of supporting malleability on MPI jobs to reduce fragmentation and consequently improve the performance of the system were studied. <br/>The contributions made in this work can be summarized as follows:<br/>· Virtual malleability: A mechanism where a job is assigned a dynami

APA, Harvard, Vancouver, ISO, and other styles

12

Lakkimsetti, Praveen Kumar. "A framework for automatic optimization of MapReduce programs based on job parameter configurations." Kansas State University, 2011. http://hdl.handle.net/2097/12011.

Full text

Abstract:

Master of Science<br>Department of Computing and Information Sciences<br>Mitchell L. Neilsen<br>Recently, cost-effective and timely processing of large datasets has been playing an important role in the success of many enterprises and the scientific computing community. Two promising trends ensure that applications will be able to deal with ever increasing data volumes: first, the emergence of cloud computing, which provides transparent access to a large number of processing, storage and networking resources; and second, the development of the MapReduce programming model, which provides a high

APA, Harvard, Vancouver, ISO, and other styles

13

Ahmed, Zubair. "Developing an efficient scheduling template of a chemotherapy treatment unit: simulation and optimization approach." Australasian Medical Journal, 2011. http://hdl.handle.net/1993/5084.

Full text

Abstract:

This study is undertaken to improve the performance of a Chemotherapy Treatment Unit by increasing the throughput of the clinic and reducing the average patients’ waiting time. In order to achieve this objective, a simulation model of this system is built and several scenarios that target matching the arrival pattern of the patients and resources availability are designed and evaluated. After performing detailed analysis, one scenario proves to provide the best system’s performance. The best scenario determines a rational arrival pattern of the patient matching with the nurses’ availability an

APA, Harvard, Vancouver, ISO, and other styles

14

Schlagkamp, Stephan [Verfasser], Uwe Akademischer Betreuer] Schwiegelshohn, and Andrei [Gutachter] [Tchernykh. "User-aware performance evaluation and optimization of parallel job schedulers / Stephan Schlagkamp ; Gutachter: Andrei Tchernykh ; Betreuer: Uwe Schwiegelshohn." Dortmund : Universitätsbibliothek Dortmund, 2017. http://d-nb.info/1139892584/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Schlagkamp, Stephan Verfasser], Uwe [Akademischer Betreuer] Schwiegelshohn, and Andrei [Gutachter] [Tchernykh. "User-aware performance evaluation and optimization of parallel job schedulers / Stephan Schlagkamp ; Gutachter: Andrei Tchernykh ; Betreuer: Uwe Schwiegelshohn." Dortmund : Universitätsbibliothek Dortmund, 2017. http://d-nb.info/1139892584/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Calmels, Dorothea [Verfasser], and Hans [Akademischer Betreuer] Ziegler. "Job Sequencing and Tool Switching Problems with a Generalisation to Non-Identical Parallel Machines / Dorothea Calmels ; Betreuer: Hans Ziegler." Passau : Universität Passau, 2020. http://d-nb.info/1218780703/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Gama, Pinheiro Vinicius. "The management of multiple submissions in parallel systems : the fair scheduling approach." Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM042/document.

Full text

Abstract:

Le problème étudié est celui de l'ordonnancement d'applications dans lessystèmes parallèles et distribués avec plusieurs utilisateurs. Les nouvellesplates-formes de calcul parallèle et distribué offrent des puissances trèsgrandes qui permettent d'envisager la résolution d'applications complexesinteractives. Aujourd'hui, il reste encore difficile d'utiliser efficacementcette puissance par manque d'outils de gestion de ressources. Le travaileffectué dans cette thèse se place dans cette perspective d'analyser etdévelopper des algorithmes efficaces pour gérer efficacement des ressources decalcul p

APA, Harvard, Vancouver, ISO, and other styles

18

Etinski, Maja. "DVFS power management in HPC systems." Doctoral thesis, Universitat Politècnica de Catalunya, 2012. http://hdl.handle.net/10803/96192.

Full text

Abstract:

Recent increase in performance of High Performance Computing (HPC) systems has been followed by even higher increase in power consumption. Power draw of modern supercomputers leads to very high operating costs and reliability concerns. Furthermore, it has negative consequences on the environment. Accordingly, over the last decade there have been many works dealing with power/energy management in HPC systems. Since CPUs accounts for a high portion of the total system power consumption, our work aims at CPU power reduction. Dynamic Voltage Frequency Scaling (DVFS) is a widely used techniqu

APA, Harvard, Vancouver, ISO, and other styles

19

Araújo, Felipe Francisco Bezerra. "Modelos e algoritmos para variações do problema de balanceamento de linhas de produção e designação de trabalhadores." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-30112016-141117/.

Full text

Abstract:

O problema de balanceamento de linhas de produção e designação de trabalhadores é uma extensão do problema simples de balanceamento de linhas onde os tempos de execução de tarefas são dependentes dos trabalhadores. Este problema tem sua motivação prática oriunda de linhas de produção com trabalhadores com deficiência. Nesta tese de doutorado estudamos duas extensões para o problema: a primeira layouts de linhas com estações em paralelo, enquanto que a segunda possibilita o uso de múltiplas linhas. As extensões fora aplicadas tanto ao problema básico quanto para o problema de rotação de tarefa

APA, Harvard, Vancouver, ISO, and other styles

20

Georgiou, Yiannis. "Contributions for resource and job management in high performance computing." Grenoble, 2010. http://www.theses.fr/2010GRENM079.

Full text

Abstract:

Le domaine du Calcul à Haute Performance (HPC) évolue étroitement avec les dernières avancées technologiques des architectures informatiques et des besoins toujours croissants en demande de puissance de calcul. Cette thèse s'intéresse à l'étude d'un type d'intergiciel particulier appelé gestionnaire de tâches et ressources (RJMS) qui est chargé de distribuer la puissance de calcul aux applications dans les plateformes pour le HPC. Le RJMS joue un rôle central du fait de sa position dans la pile logicielle. Les dernières évolutions dans les couches matérielles et dans les applications ont large

APA, Harvard, Vancouver, ISO, and other styles

21

Delgado, Javier. "Scheduling Medical Application Workloads on Virtualized Computing Systems." FIU Digital Commons, 2012. http://digitalcommons.fiu.edu/etd/633.

Full text

Abstract:

This dissertation presents and evaluates a methodology for scheduling medical application workloads in virtualized computing environments. Such environments are being widely adopted by providers of “cloud computing” services. In the context of provisioning resources for medical applications, such environments allow users to deploy applications on distributed computing resources while keeping their data secure. Furthermore, higher level services that further abstract the infrastructure-related issues can be built on top of such infrastructures. For example, a medical imaging service can allow m

APA, Harvard, Vancouver, ISO, and other styles

22

Song, Bin 1970. "Scheduling adaptively parallel jobs." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/50354.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Ramachandra, Girish. "Scheduling Precedence Related Jobs on Identical Parallel Processors." NCSU, 2002. http://www.lib.ncsu.edu/theses/available/etd-20020121-185145.

Full text

Abstract:

<p>The 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

APA, Harvard, Vancouver, ISO, and other styles

24

Sen, Siddhartha 1981. "Dynamic processor allocation for adaptively parallel work-stealing jobs." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/33355.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.<br>Includes bibliographical references (p. 77-82).<br>TCP's burstiness is usually regarded as harmful, or at best, inconvenient. Instead, this thesis suggests a new perspective and examines whether TCP's burstiness is useful for certain applications. It claims that burstiness can be harnessed to insulate traffic from packet reordering caused by route change. We introduce the use of flowlets, a new abstraction for a burst of packets from a particular flow followed by an idle inte

APA, Harvard, Vancouver, ISO, and other styles

25

Sobalvarro, Patrick G. "Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43588.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.<br>Includes bibliographical references (p. 92-94).<br>by Patrick Gregory Sobalvarro.<br>Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

26

Speck, Jochen Matthias [Verfasser], and P. [Akademischer Betreuer] Sanders. "Theory and Engineering of Scheduling Parallel Jobs / Jochen Matthias Speck ; Betreuer: P. Sanders." Karlsruhe : KIT-Bibliothek, 2018. http://d-nb.info/1162540745/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Hung, Hui-Chih. "Allocation of jobs and resources to work centers." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1141849609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Cincioglu, Derya. "A Rescheduling Problem With Controllable Processing Times:trade-off Between Number Of Disrupted Jobs And Reschedulingcosts." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613950/index.pdf.

Full text

Abstract:

In this thesis, we consider a rescheduling problem on non-identical parallel machines with controllable processing times. A period of unavailability occurs on one of the machines due to a machine failure, material shortage or broken tool. These disruptions may cause the original schedule to become inecient and sometimes infeasible. In order to generate a new and feasible schedule, we are dealing with two conflicting measures called the eciency and stability measures simultaneously. The eciency measure evaluates the satisfaction of a desired objective function value and the stability measure ev

APA, Harvard, Vancouver, ISO, and other styles

29

GHEDJATI-GUESSOUM, FATIMA, and Jean-Charles Pomerol. "Resolution par des heuristiques dynamiques et des algorithmes genetiques du probleme d'ordonnancement de type job-shop generalise (a machines non identiques en parallele et contraintes de precedence)." Paris 6, 1994. http://www.theses.fr/1994PA066581.

Full text

Abstract:

L'objectif de cette these est la resolution approchee du probleme d'ordonnancement d'atelier de type job-shop generalise a machines non identiques en parallele et contraintes de precedente (ou les gammes des travaux sont non-lineaires). La premiere phase de ce travail consiste a creer un generateur d'ordonnancement ainsi qu'un environnement de programmation permettant d'une part, de tester rapidement differentes heuristiques statiques et surtout dynamiques et d'autre part, de basculer facilement et dynamiquement d'une heuristique a une autre sans changer l'algorithme de base. La strategie util

APA, Harvard, Vancouver, ISO, and other styles

30

Renaud-Goud, Paul. "Energy-aware scheduling : complexity and algorithms." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2012. http://tel.archives-ouvertes.fr/tel-00744247.

Full text

Abstract:

In this thesis we have tackled a few scheduling problems under energy constraint, since the energy issue is becoming crucial, for both economical and environmental reasons. In the first chapter, we exhibit tight bounds on the energy metric of a classical algorithm that minimizes the makespan of independent tasks. In the second chapter, we schedule several independent but concurrent pipelined applications and address problems combining multiple criteria, which are period, latency and energy. We perform an exhaustive complexity study and describe the performance of new heuristics. In the third c

APA, Harvard, Vancouver, ISO, and other styles

31

Lasmezas, Franck. "Vies et mises en récits (auto) biographiques : la collection "l'un et l'autre" de J.B Pontalis (1988 - 2013)." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE2091.

Full text

Abstract:

Déclaré moribond avec le XXème siècle finissant, le genre biographique allait renaître sous l’impulsion de figures du monde éditorial dont J.-B. Pontalis fut l’une des principales. La collection L’un et l’autre explore la relation biographique sous les angles de la paternité, de la maternité, du soin. Ces notions ne sont pas littérales, mais littéraires, inscrites non seulement dans le langage, mais dans une langue particulière. La collection fait vivre des parallélismes dont le plus important est celui de la création littéraire de J.-B. Pontalis : la collection a influencé l’œuvre, qui a à so

APA, Harvard, Vancouver, ISO, and other styles

32

Yeh, Shih-Lun, and 葉士綸. "Parallel Machine Scheduling with Job Splitting." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/36832661505975830611.

Full text

Abstract:

碩士<br>國立清華大學<br>工業工程與工程管理學系<br>97<br>This study focuses on the problem of scheduling jobs on identical parallel machines with job-splitting property. In this problem, it assumed that a job can be split into several sub-jobs, and these sub-jobs can be processed on different machines simultaneously. Each job has a processing time, a ready date and a due date. If a sub-job of a job is assigned after a sub-job of another job on a machine, a sequence-dependent setup time is incurred. A two-phase heuristic algorithm is proposed to minimize the total tardiness. In phase 1, five efficient heuristic me

APA, Harvard, Vancouver, ISO, and other styles

33

Chu, Liang-Chi, and 朱良琪. "Minimizing total tardiness on uniform parallel machine with job arrival and incompatible job families." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/52814737125486202766.

Full text

Abstract:

碩士<br>中原大學<br>工業與系統工程研究所<br>101<br>We consider the problem of scheduling n jobs with f families on m uniform parallel machines. Every job has arrival time and belongs to one family. We have to add setup time when machine is processing one job( this job’s family is different to last job ). Our objective is to minimize total tardiness. First, we use heuristic assign family into machine for reducing setup time then we find families with greater overlap and using greedy algorithm to remove jobs from machine . For those jobs witch are removed we try assign them into every position. When we are

APA, Harvard, Vancouver, ISO, and other styles

34

Patterson, Jordan. "Jole: a library for dynamic job-level parallel workloads." Master's thesis, 2009. http://hdl.handle.net/10048/727.

Full text

Abstract:

Problems in scientific computing often consist of a workload of jobs with dependencies between them. Batch schedulers are job-oriented, and are not well-suited to executing these workloads with complex dependencies. We introduce Jole, a Python library created to run these workloads. Jole has three contributions that allow flexibility not possible with a batch scheduler. First, dynamic job execution allows control and monitoring of jobs as they are running. Second, dynamic workload specification allows the creation of workloads that can adjust their execution while running. Lastly, dynamic inf

APA, Harvard, Vancouver, ISO, and other styles

35

Huang, Hsin-Chiang, and 黃信強. "A Genetic Algorithm for Job Scheduling on Parallel Machine." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/96291080791312524760.

Full text

Abstract:

碩士<br>淡江大學<br>資訊管理學系<br>88<br>In order to make the solution of manufacturing scheduling more realistic, we consider earliness/tardiness cost, machine idle time cost, and machine setup cost in the selection of sub-optimal solution. In the case of parallel-machine scheduling, the problem has been proven to be NP-hard. Several applications of Genetic Algorithms to solve the optimization problems have been proposed recently. They have been shown to obtain better results than other algorithms. Thus, this research will investigate a new type of chromosomes and define its evolution processes in a Gen

APA, Harvard, Vancouver, ISO, and other styles

36

Patterson, Jordan Dacey Lee. "Jole a library for dynamic job-level parallel workloads /." 2009. http://hdl.handle.net/10048/727.

Full text

Abstract:

Thesis (M. Sc.)--University of Alberta, 2009.<br>Title from PDF file main screen (viewed on Nov. 27, 2009). "A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Master of Science, Department of Computing Science, University of Alberta." Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

37

Chen, Tai-Lung, and 陳泰龍. "Optimizing Communications and Job Scheduling in Heterogeneous Parallel Systems." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/70753115420465323988.

Full text

Abstract:

博士<br>中華大學<br>工程科學博士學位學程<br>98<br>Job scheduling and broadcasting strategy are the important issues to improve system performance in heterogeneous systems. To investigate the problems of grid technologies in high performance computing, the message broadcasting, job scheduling, resource management and quality of services have always been the main challenges. In the variety of heterogeneous environments, the design of job allocating and message forwarding strategies depending on the network architecture and the construct of resources. In this study, the contention-free broadcasting, task sche

APA, Harvard, Vancouver, ISO, and other styles

38

Pan, Guo-Cheng, and 潘國丞. "A Study of Multi-Objective Parallel-Machine Job Shop Rescheduling." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/78217015721347891195.

Full text

Abstract:

碩士<br>東海大學<br>工業工程與經營資訊學系<br>94<br>In the dynamic production environment, unexpected events or disruptions occur frequently, make the production schedule infeasible and then need to be updated. This research addresses a job-shop parallel-machine rescheduling problem with multiple-objectives concerned. Rescheduling factors included in this research are machine breakdown, shortage of materials and rush order. In this research, a rescheduling method that uses partial rescheduling and complete rescheduling is proposed. We use partial rescheduling to update the initial schedule and preserve it as m

APA, Harvard, Vancouver, ISO, and other styles

39

Chiou, Jian-hao, and 邱建豪. "A Dynamic Worldwide Computing Paltform on Job-Parallel Computing System." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/04875343504822859207.

Full text

Abstract:

碩士<br>國立中央大學<br>資訊工程研究所<br>97<br>A job-parallel grid system considers each program to be executed as a job,and looks for available computing resources for the job. The major advantages of a job-parallel grid system are: (1) job execution can be easily handled by users, and (2) executable files can be submitted to the system without program re-engineering. The disadvantage is that its programmability is not good enough to support advanced communication primitives. On the contrary, a worldwide computing grid system utilizes the power of the internet and the technology of virtual machines to inte

APA, Harvard, Vancouver, ISO, and other styles

40

Chuang, Shan-ping, and 莊尚平. "Simultaneous Job Scheduling and Resource Allocaton on Parallel Work Centers." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/87469084469396726792.

Full text

Abstract:

博士<br>國立臺灣科技大學<br>工業管理系<br>96<br>This study addresses a job scheduling and resource allocation (JSRA) problem with distinct release dates and due dates to minimize total tardiness in parallel work centers with a multi-processor environment. To solve the problem, this study proposes a hybrid genetic algorithm (HGA) with release and due date based decomposition heuristic. Five small-sized test problems are performed to evaluate the performance of the HGA, the pure GA (PGA), and the optimum solution obtained using Lingo 7.0. The results show that the percentage deviations between the HGA and Ling

APA, Harvard, Vancouver, ISO, and other styles

41

Lai, Yi-hsiang, and 賴以翔. "Parallel Machine Scheduling with Machine Availability, Eligibility and Job Incompatible Constraint." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/55577676941553418505.

Full text

Abstract:

碩士<br>國立中央大學<br>工業管理研究所<br>95<br>In this paper we consider the problem of scheduling n non-preemptive jobs on m identical machines with machine availability, eligibility and incompatible job constraints when minimizing the maximum lateness. Each machine is not continuously available at all time and each job is only allowed to be processed on specific machines. Each job has to be processed at an availability interval with the same service level or higher. Some job belongs to a family and only jobs from different family may be processed in the same availability interval. We propose a branch and

APA, Harvard, Vancouver, ISO, and other styles

42

Wei, Wang Chen, and 王甄薇. "On multi-stage parallel-machine job shop scheduling with due windows." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/13681256911560614536.

Full text

Abstract:

碩士<br>輔仁大學<br>管理學研究所<br>96<br>How to lower cost is every manufacturer’s the most important problem. Consider due window into scheduling can reduce not only the stock cost and the waste of space but also the idle time. Besides, add the quantity of machine can enlarge capacity and reach economic of scale. The study confer multi-stage parallel-machine job shop scheduling with due windows and focusing on scheduling with this study and expect to get a closer solution near the optimal solution. Minimize the total penalty due to the earliness and tardiness. We construct the mathematics model for mul

APA, Harvard, Vancouver, ISO, and other styles

43

Hsu, Hao-chun, and 徐豪駿. "Parallel Machine Scheduling with Machine Availability,Eligibility and Job Incompatible Constraints." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/24082829472579173289.

Full text

Abstract:

碩士<br>國立中央大學<br>工業管理研究所<br>100<br>In this paper we consider the problem of scheduling n preemptive jobs on m identical machines with machine availability, eligibility and incompatible job constraints when minimizing the maximum makespan. Each machine is not continuously available for processing at all time and each job is only allowed to be processed on specific machines. In the same availability interval, each job belongs to a family and only jobs from different family can be processed. Firstly, we use a network flow technique to model the scheduling problem with the job preemption into a ser

APA, Harvard, Vancouver, ISO, and other styles

44

Chang, Wen-Ting, and 張文亭. "The job-splitting scheduling of varying-time-window jobs on parallel machines by mixed integer programming." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/23391267698472535574.

Full text

Abstract:

碩士<br>國立清華大學<br>工業工程與工程管理學系<br>101<br>This study is motivated by the production management problem found in many large-volume MTO systems. In such an environment, a decision maker has to evaluate the requested due dates if are capacity feasibility, and further, to determine how to distribute each confirmed order with arbitrary ready date and due date to parallel machines so that the demand quantity and the due date can be met. Sequence- and machine-dependent setup times in unrelated parallel machine systems are considered in this study. In order to finish promised orders on time, splitting the

APA, Harvard, Vancouver, ISO, and other styles

45

Chan, Pei-Yun, and 詹珮芸. "Parallel Machine Scheduling with Minimal and Maximal Time Lags for Reentrant Job." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/87573722329193258185.

Full text

Abstract:

碩士<br>國立中央大學<br>工業管理研究所<br>95<br>In this paper we study the problem of scheduling recirculation jobs on identical parallel machines with eligibility and availability restrictions when minimizing the makespan. Namely, each job may visit a machine more than once and is only allowed to be processed on specific machines; each machine is not always available for processing. Besides, minimal and maximal time lag constraints on the starting time of each reentrant job are also considered. We develop two branch and bound algorithms to solve the scheduling problem optimally. One is to deal with the jo

APA, Harvard, Vancouver, ISO, and other styles

46

CHAO, CHIEN-WEN, and 趙謙文. "Minimizing Sum of Job Completion Times on Parallel Machines with Machine Restrictions." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/25ywxu.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>工業管理系<br>95<br>The thesis studies two problems of parallel machines to minimize the sum of job completion times. The first problem is to schedule jobs on two identical parallel machines when a machine is available only in a specified time period. This thesis proposes an optimal branch-and-bound algorithm which employs three powerful elements, including an algorithm for computing upper bound, a lower bound algorithm, and a fathoming condition. The branch and bound algorithm was tested on problems of various sizes and parameters. The results show that the algorithm is quite eff

APA, Harvard, Vancouver, ISO, and other styles

47

Su, Chi-shiang, and 蘇啟祥. "Two parallel machines scheduling problems with job delivery coordination and availability constraint." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/21196232035287077834.

Full text

Abstract:

博士<br>國立臺灣科技大學<br>工業管理系<br>99<br>In a rapid changing environment, the way of competition among enterprises has a tendency towards competing between supply chain systems instead of competing between individual companies. Traditional scheduling models which only address the sequence of jobs to be processed at the production stage under some criteria are no longer suitable and should be extended to cope with the distribution stage after production. Emphasizing on the coordination and the integration among various members of a supply chain has become one of the vital strategies for the modern manu

APA, Harvard, Vancouver, ISO, and other styles

48

Chen, Kuan Ming, and 陳冠名. "An Application of Parallel Metaheuristic Methods for Solving Job Shop Scheduling Problem." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/54019754291739772494.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

WANG, YUE-FANG, and 王月芳. "The effect of job splitting on flow time forecasts for parallel machine scheduling." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/cub4b6.

Full text

Abstract:

碩士<br>國立高雄第一科技大學<br>運籌管理系碩士班<br>105<br>In order to improve manufacturing services to face the global competition, companies usually use parallel machines to increase production capacity. But pursuing utilization often change schedule, might lose predictive accuracy at flow time, therefore, the purpose of the study is explore the parallel machine operating, for different type of work needed to setup and with the flexibility of the rules of job splitting, hope to find appropriate combination with job splitting and scheduling, can take care due date and stability of the production process, making

APA, Harvard, Vancouver, ISO, and other styles

50

Hsueh, Po-Jen, and 薛博仁. "A Research of Multi-Objective Parallel-Machine Drum-Buffer-Rope Job-Shop Scheduling." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/86810114596356011678.

Full text

Abstract:

碩士<br>東海大學<br>工業工程與經營資訊學系<br>102<br>Drum-Buffer-Rope (DBR) is Theory of Constraints (TOC) use scheduling theory of technology to the field, main spirit for take advantage of bottlenecks or constraint resources, in order to ensure that the overall capacity to maximize output, the main trick is to buffer management. This study is based on job-shop parallel-machine scheduling, proposed use Genetic Algorithms(GA) combine with Drum-Buffer-Rope, as a priority in the quantitative bottlemeck and qualitative bottleneck, for multi-enterprise business strategy goals, solving a set of complete schedule pl

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!