To see the other types of publications on this topic, follow the link: Dispatching.
Dissertations / Theses on the topic 'Dispatching'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Dispatching.'
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
Van, de Venter Al '. louise. "Dispatching emergency reserves." Master's thesis, University of Cape Town, 2015. http://hdl.handle.net/11427/13727.
Full textAbstract:
This dissertation presents the analysis of cost-effective dispatching of emergency reserves with a specific focus on supply and demand side options. On the demand side options the focus is the demand market participation product. On the supply side options the use of hydro and gas specifically the open cycle gas turbines are studied. In capacity constraint systems, supplying the demand with the current generation mix needs to be met. With a diminishing reserve margin and increase in demand yearly this challenge increases. The South African scenario is reported in this paper. As demand grows the ability to meet that demand remains a focus; a responsibility that remains a priority for the system operator. In times of surplus or shortage generation with adequate or diminishing reserve margins the focus on dispatching optimally and economically is an important aspect. Currently the South African Interconnected Power System is constrained; at times there is more demand than supply. The reserve categories are the ancillary requirements and are different for all power systems. Reserves are to cater for disturbances on the power system to ensure a healthy frequency is maintained. Reserve categories according to the ancillary requirements are: instantaneous, regulating, ten minute, supplemental and emergency. This dissertation focuses on emergency reserve.
2
Sanusi, Afeez Ayinla. "Train Dispatching: Heuristic Optimization." Thesis, Högskolan Dalarna, Datateknik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4107.
Full textAbstract:
Train dispatchers faces lots of challenges due to conflicts which causes delays of trains as a result of solving possible dispatching problems the network faces. The major challenge is for the train dispatchers to make the right decision and have reliable, cost effective and much more faster approaches needed to solve dispatching problems. This thesis work provides detail information on the implementation of different heuristic algorithms for train dispatchers in solving train dispatching problems. The library data files used are in xml file format and deals with both single and double tracks between main stations. The main objective of this work is to build different heuristic algorithms to solve unexpected delays faced by train dispatchers and to help in making right decisions on steps to take to have reliable and cost effective solution to the problems. These heuristics algorithms proposed were able to help dispatchers in making right decisions when solving train dispatching problems.
3
Delikoura, Eirini. "Thread Dispatching in Barrelfish." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-147675.
Full textAbstract:
Current computer systems are becoming more and more complex. Even commodity computers nowadays have multiple cores while heterogeneous systems are about to become the mainstream computer architecture. Parallelism, synchronization and scaling are thus becoming issues of grave importance that need to be addressed efficiently. In environments like that, creating dedicated software and Operating Systems is becoming a difficulty for performance enhancement. Developing code for just a specific machine can prove to be both expensive and wasteful since technology advances with such speed that what is considered state-of-the-art today becomes quickly obsolete. The Multikernel schema and its implementation, the Barrelfish OS, target a group of different architectures and environments even when these environments “co-exist" on the same system. We present a different approach on loading and executing programs and using our new scheduling policy we handle tasks rather than threads, balancing work-load and developing a dynamic environment with respect to scaling and performance. Our goal is to use our findings in order to establish a more controlled way to use resources.
4
Conner, Stephen J. "Distributed dispatching for embedded generation." Thesis, University of Strathclyde, 2003. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=21513.
Full textAbstract:
Electrical power systems are currently moving towards distributed generation, using many small generators instead of a few large ones. This can potentially produce great improvements in efficiency, by allowing utilisation of waste heat (cogeneration). However, it also poses new problems of control and co-ordination of large numbers of generators, which may be connected deep within the distribution network. It is well known that existing schemes for planning, dispatching and protection of central generators are not directly applicable to the new technology, and dispatching (scheduling) of small embedded generators is not currently feasible. In this work, a novel dispatching management system which may meet this requirement is proposed. Instead of using a single control centre, it distributes dispatching functions throughout the network. Some functions are performed by controllers and software agents built into the embedded generators themselves, and others handled by dispatcher software associated with a group of generators and loads. The dispatcher operates a small virtual market where energy can be traded between agents representing: generators, loads, network functions (AVR etc), and other dispatchers. This allows multiple dispatchers to be interconnected, so potentially dealing with very large numbers of generators. To test this concept, some prototype agents, a basic dispatcher, and means of communication were created, in the form of programs on a desktop computer. The "REDMan" suite of software achieved successful trading of energy in a simulated environment. This motivated a more advanced trial where REDMan was developed further and used for experimental dispatching of real generating equipment and loads. Construction and assembly of the experimental apparatus, interfacing of hardware to the computer environment, experiments and results are presented and discussed here. The experimental system was dispatched in a satisfactory manner, and much practical experience was gained in the issues relating to dispatching of EG. Several possible avenues for further research were identified.
5
Парфененко, Юлія Вікторівна, Юлия Викторовна Парфененко, Yuliia Viktorivna Parfenenko, Алла Миколаївна Дядечко, Алла Николаевна Дядечко, and Alla Mykolaivna Diadechko. "Heat-supply network dispatching system." Thesis, Вид-во СумДУ, 2009. http://essuir.sumdu.edu.ua/handle/123456789/16748.
Full text
6
Winter, Thomas. "Online and real-time dispatching problems." [S.l. : s.n.], 1999. http://deposit.ddb.de/cgi-bin/dokserv?idn=958326584.
Full text
7
Minkoff, Alan Seth. "Real-time dispatching of delivery vehicles." Thesis, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/15267.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1985.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.
Vita.
Bibliography: leaves 249-251.
by Alan Seth Minkoff.
Ph.D.
8
Roznitsky, Yoel 1974. "Automated lot dispatching in semiconductor fabrication." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/89317.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering; and, (S.M.)--Massachusetts Institute of Technology, Sloan School of Management; in conjunction with the Leaders for Manufacturing Program at MIT, 2001.Includes bibliographical references (leaves 65-66).
by Yoel Roznitsky.
S.M.
9
Braden, Thomas J. "The Incident Dispatching and Tracking System." UNF Digital Commons, 2000. http://digitalcommons.unf.edu/etd/264.
Full textAbstract:
The Incident Dispatching and Tracking System (IDTS) was developed to facilitate the technical support of an organization. IDTS provides a means by which a user may submit their issue/problem to the system and receive a unique trouble ticket number. This number can then be used to view the status of that record, minimizing the need for inquiries to the technical support team. IDTS also provides a dispatching function that assigns each trouble ticket to a technician that specializes in that type of issue. Finally, there is a reporting function that allows the technical support team to view the current technical status of the organization, generate statistics on previously submitted trouble tickets, and determine areas that may require assistance in the future.
10
Molstad, Phillip James. "TripLogic : a demand-response dispatching system /." Connect to title online, 2007. http://minds.wisconsin.edu/handle/1793/34212.
Full text
11
MOSCA, ALESSIO. "Optimal Dispatching Solutions for Industry 4.0." Doctoral thesis, Università degli studi di Pavia, 2020. http://hdl.handle.net/11571/1326208.
Full text
12
Shikalgar, Sameer Tajuddin. "Reduction of Average Cycle Time at a Wafer Fabrication Facility." Thesis, Virginia Tech, 2000. http://hdl.handle.net/10919/35961.
Full textAbstract:
This research is concerned with the development of effective solutions for the reduction of average cycle time at a wafer fabrication facility. The wafer fabrication environment is quite different from the usual flow shop or job shop environments, with a distinguishing feature being the reentrant flow of the lots through the system. Lots at different stages of their manufacturing cycle may revisit the machines. This gives rise to the need of effective policies to sequence lots through the system.
The study is being conducted on a M/A-COM's wafer fabrication system. The facility on which the study is being conducted is based in Roanoke, VA. The facility consists of 92 machines and its products can be classified into six different types. The data required for each product such as routing, processing times, yield at each operation etc. have been acquired from the facility. Two methodologies have been developed to effect a reduction in the cycle time of the products at M/A-COM's facility. The first methodology is heuristic procedure based on the idea of reducing idle time on the bottleneck machine. The second methodology is based on mathematical programming.
For the first methodology, the manufacturing system is simulated using AutoSchedAP, which is part of the AutoSimulations Inc. software package. The software enables the accurate modeling of the existing system using actual part routes, station definitions, operator definitions, shift calendars, input orders, machine breakdowns and processing and setup time distributions. The proposed approach, to reduce cycle time, is based on the principle of reduction of idle time at the bottleneck machine. The bottleneck machine controls the throughput of the system and any unnecessary idle time at the bottleneck leads to an increase in the average cycle time. The AutoSchedAP software enables the user to write custom scheduling rules using C++ and integrate it with the simulation model. The performance of the proposed procedure is compared with those of various other scheduling rules in the software.
The second proposed methodology models the system as an integer program. The integer program reads the various machine and product data and establishes the optimal flow of the lots through the system. The integer program uses the start time of lots, at various operations, as variables and outputs the time at which each lot should be started at each operation. The integer program is solved using CPLEX, which is a linear and integer programming software. Presently, various methods are being analyzed to relax the integer program into an equivalent linear/nonlinear program, since solving an integer program consumes a lot of time, even for small problems.
A third methodology has also been proposed. This methodology concerns the modeling of the system on the basis of a conjunctive-disjunctive graph. The main idea in this methodology is that the minimization of maximum lateness at each operation would result in the minimization of maximum cycle time of the overall system.
Some preliminary results obtained are presented. Also, the work in progress is described.Master of Science
13
Morris, Steven Michael. "Truck Dispatching and Fixed Driver Rest Locations." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19745.
Full textAbstract:
This thesis sets out to analyze how restricting rest (sleep) locations for long-haul truckers may impact operational productivity, given hours-of-service regulations. Productivity in this thesis is measured by the minimum number of unique drivers required to feasibly execute a set of load requests over a known planning horizon. When drivers may stop for rest at any location, they may maximize utilization under regulated
driving hours. When drivers may only rest at certain discrete locations, their productivity may be diminished since they may no longer be able to fully utilize available service hours. These productivity losses may require trucking firms to operate larger driver fleets.
This thesis addresses two specific challenges presented by this scenario; first, understanding how a given discrete set of rest locations may affect driver fleet size requirements; and second, how to determine optimal discrete locations for a fixed number of rest facilities and the potential negative impact on fleet size of non-optimally located facilities. The minimum fleet size problem for a single origin-destination leg with fixed possible rest locations is formulated as a minimum cost network flow with additional bundling constraints. A mixed integer program is developed for solving the single-leg rest facility location problem. Tractable adaptations of the basic models to handle problems with multiple lanes are also presented.
This thesis demonstrates that for typical long-haul lane lengths the effects of restricting rest to a relatively few fixed rest locations has minimal impact on fleet size. For an 18-hour lane with two rest facilities, no increase in fleet size was observed for any test load set instances with exponentially distributed interdeparture times. For test sets with uniformly distributed interdeparture times, additional required fleet sizes ranged from 0 to 11 percent.
The developed framework and results should be useful in the analysis of truck transportation of security-sensitive commodities, such as food products and hazardous materials, where there may exist strong external pressure to ensure that drivers rest only in secure locations to reduce risks of tampering.
14
Jabr, Rabih Adel. "Interior-point methods for power generation dispatching." Thesis, Imperial College London, 2000. http://hdl.handle.net/10044/1/8428.
Full text
15
Ucko, Aaron Mark 1977. "Predicate dispatching in the Common Lisp Object." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/32095.
Full textAbstract:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 81-83).
I have added support for predicate dispatching, a powerful generalization of other dispatching mechanisms, to the Common Lisp Object System (CLOS). To demonstrate its utility, I used predicate dispatching to enhance Weyl, a computer algebra system which doubles as a CLOS library. My result is Dispatching-Enhanced Weyl (DEW), a computer algebra system that I have demonstrated to be well suited for both users and programmers.
by Aaron Mark Ucko.
M.Eng.
16
Knoops, Lorinde, and Tilda Lundgren. "Modeling ambulance dispatching rules for EMS-systems." Thesis, KTH, Optimeringslära och systemteori, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189023.
Full textAbstract:
This thesis presents a study on efficient dispatching rules in ambulance dispatching. By efficient dispatching rules, we mean such dispatching rules that lower response times for priority 1 calls while keeping response times for priority 2 calls at an adequate level. A Markov process and a simulation model were developed in order to evaluate the performance of several existing and newly designed dispatching rules. On four different response areas, five different dispatching rules were tested and their performances were compared. Particular focus was put upon the dispatch rule currently used by the Swedish emergency service provider SOS Alarm; the Closest rule. Our findings indicate that the four priority-based dispatching rules all outperform the Closest rule in decreasing the mean response time for calls of priority degree 1. Furthermore, implementing restrictions on the travel time for priority 2 calls was proven an efficient way to control the trade-off between the mean response time of priority 1 and 2 calls. The conclusion was drawn that the possibilities for more efficient ambulance dispatching are many and that SOS Alarm should consider implementing priority-based dispatching rules, alike the ones presented in this thesis, in their dispatching process. A study of the ambulance operator and controller profession, and the operator’s and controller’s interplay with the decision support system used by SOS Alarm in the ambulance dispatching process, was conducted in parallel. The properties of the interaction dynamics between operator and automation and the dangers linked to it were mapped out, described and analyzed.Denna kandidatexamensuppsats behandlar effektiva dirigeringsstrategier inom ambulansdirigering. Effektiva dirigeringsstrategier åsyftar dirigeringsstrategier som lyckas sänka svarstiden för inkommande prioritet 1-samtal, samtidigt som svarstiden för prioritet 2-samtal hålls på en tillfredsställande nivå. I syfte att utvärdera olika dirigeringsstrategier utvecklades både en Markovsk modell och en simuleringsmodell. På fyra olika geografiska områden testades och jämfördes. Fem olika dirigeringsstrategier, varav två existerande och tre nyutvecklade. Särskilt fokus riktades mot Closest rule, vilket är den dirigeringsstrategi som används i SOS Alarms verksamhet idag. Från resultaten kunde utläsas att de prioritets-baserade dirigeringsstrategierna resulterade i en lägre genomsnittlig svarstid för prioritet 1-fall än Closest rule. Dessutom konstaterades det att en begränsning av svarstiderna för prioritet 2-samtal var ett effektivt sätt att kontrollera balansen mellan de genomsnittliga svarstiderna för samtal av prioritet 1, respektive 2. Slutsatsen drogs att möjligheterna för att utveckla nya effektiva dirigeringsstrategier är många och att SOS Alarm bör överväga att implementera prioritetsbaserade dirigeringsstrategier likt dem som presenterats i denna uppsats. Parallellt studerades ambulansoperatörens och -dirigentens yrkeskunnande, samt operatörens och dirigentens samspel med det beslutsstödssystem som används i SOS Alarms dirigeringsverksamhet. Interaktionen mellan operatör och automatisering samt de relaterade riskerna kartlades, beskrevs och analyserades.
17
Song, Wei 1970. "Real time dispatching control in transit systems." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/50512.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1998.Includes bibliographical references (leaf 131).
Maintenance of reliable service is a goal of any rail transit agency. Reliability is difficult to maintain due to the perturbations that serve to disrupt headway sequences. These incidents that affect the service quality of transportation agencies can be categorized into two types, major disruptions and minor disturbances, based on their nature and causes. To maximize the capacity of a rail transit line and avoid busing, single track operation is analyzed in this thesis to deal with major disruptions. Based on the tracks and crossover configuration of the Massachusetts Bay Transportation Authority Red Line, a full analysis of possible strategies is presented which might form the basis for a major disruption response system. This could take the form of pre-planned short term operation plans which would be geared to the type, location and time of day of the disruption. The dispatching problem occurs around a terminal when a train is not expected to arrive at the terminal early enough to be dispatched on its next trip on schedule. This problem can be considered as a special case of minor disturbance. Its solution can also supply insight into the more general minor disturbance problem. We use holding and short turning as our control strategies to deal with the dispatching problem. Choosing minimizing passenger waiting time or the number of overcrowded trains as the objective, a heuristic dispatching control model is designed and evaluation and simulation models are used to estimate and compare the effectiveness of the current dispatching system and the heuristic dispatching control model. The results show that the heuristic dispatching control model could produce savings in average passenger waiting time of up to 14%, with the effectiveness increasing as the disruption becomes more severe. As part of this research, a dwell time model is estimated for Red Line trains in order to predict the running time of a train to help select the appropriate control strategy.
by Wei Song.
S.M.
18
Bengtsson, Fredrik, and Adam Combler. "Automatic Dispatching of Issues using Machine Learning." Thesis, Linköpings universitet, Programvara och system, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-162837.
Full textAbstract:
Many software companies use issue tracking systems to organize their work. However, when working on large projects, across multiple teams, a problem of finding the correctteam to solve a certain issue arises. One team might detect a problem, which must be solved by another team. This can take time from employees tasked with finding the correct team and automating the dispatching of these issues can have large benefits for the company. In this thesis, the use of machine learning methods, mainly convolutional neural networks (CNN) for text classification, has been applied to this problem. For natural language processing both word- and character-level representations are commonly used. The results in this thesis suggests that the CNN learns different information based on whether word- or character-level representation is used. Furthermore, it was concluded that the CNN models performed on similar levels as the classical Support Vector Machine for this task. When compared to a human expert, working with dispatching issues, the best CNN model performed on a similar level when given the same information. The high throughput of a computer model, therefore, suggests automation of this task is very much possible.
19
Li, Qing. "Real time dispatching of bus to improve transfers." Thesis, University of Ottawa (Canada), 2001. http://hdl.handle.net/10393/9438.
Full textAbstract:
The purpose of this research is to provide insight into the effectiveness of certain real time dispatching control actions on service reliability for transfer from a high frequency bus route to a low frequency bus route. A model of the operation of 2 connected bus routes was built based on data from real bus routes operated by OC Transpo in Ottawa, and a simulation program was designed and developed. This simulation program was used to conduct experiments to compare different control actions to improve transfer effectiveness, to test the impacts of the bus threshold on passenger waiting time and to evaluate the AVL detector location. We defined an objective function---cost/benefit function, to measure the system performance of the above cases. This objective function considered 2 important factors: number of passengers relevant to transfer and waiting time relevant to control. The research and simulation experiments suggested that real time monitoring technologies can improve the transit bus transferring significantly without preplanned timed transfer. The detector location is determined by feeder line headway primarily and the connecting bus holding threshold secondarily. Without considering the hard requirements from outside system, the bus holding threshold should not be greater than the feeder line headway.
20
Xu, Ji. "Study of dynamic headway control bus dispatching rules." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/9647.
Full textAbstract:
The critical criterion for evaluating a bus control strategy is how well it can improve the reliability of bus service. For high-frequency urban bus service, the service reliability is more a function of bus regularity than schedule adherence. Previous research has shown that headway control strategy is more appropriate for improving bus service with high service frequencies than the traditional schedule control strategy. A customer survey has been undertaken to determine what is the largest headway, i.e., the time between the departure of two successive buses at stops of a given route, such that headway control strategy is still reasonable for bus control. Based on the results of our survey, the research of this thesis is focused on headway control when it is believed to be suitable. Regularity of a given route for a given period of the day can be controlled through real-time actions aimed at maintaining adherence to the planned headway. While holding policies have been shown to be very effective in keeping the headway constant, they usually suffer from an inability to adjust quickly to the changing conditions along the route, such as buses breaking down, or not pulling out from the garage. In this thesis, we propose an improved holding policy--"flexible scheduling" as a means for the buses along the route to auto-regulate themselves based on real-time data obtained through the Automatic Vehicle Location Control (AVLC) system, a technology that allows the controller to know the relative position of buses along the route. The idea of flexible scheduling will be discussed in detail. Experimentation of this policy will be conducted on a simulation model. Results will be reported and analysed. A user interface which provides easy access to both the simulation model and a control module is also developed to provide a better working environment to the users of these models. Finally, conclusions and avenues for future research will be discussed.
21
Wongsavengwate, Pisamai. "Adaptive dispatching using genetic algorithms for multiple resources." Ohio : Ohio University, 1997. http://www.ohiolink.edu/etd/view.cgi?ohiou1184598551.
Full text
22
Lira, Bonates Eduardo Jorge. "Analysis of truckshovel dispatching policies using computer simulation." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65406.
Full text
23
Bastos, Guilherme Sousa. "Methods for truck dispatching in open-pit mining." Instituto Tecnológico de Aeronáutica, 2010. http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=1098.
Full textAbstract:
Material transportation is one of the most important aspects of open-pit mine operations. The problem usually involves a truck dispatching system in which decisions on truck assignments and destinations are taken in real-time. Due to its significance, several decision systems for this problem have been developed in the last few years, improving productivity and reducing operating costs. As in many other real-world applications, the assessment and correct modeling of uncertainty is a crucial requirement as the unpredictability originated from equipment faults, weather conditions, and human mistakes, can often result in truck queues or idle shovels. However, uncertainty is not considered in most commercial dispatching systems. In this thesis, we introduce novel truck dispatching systems as a starting point to modify the current practices with a statistically principled decision making methodology. First, we present a stochastic method using Time-Dependent Markov Decision Process (TiMDP) applied to the truck dispatching problem. In the TiMDP model, travel times are represented as probabilistic density functions (pdfs), time-windows can be inserted for paths availability, and time-dependent utility can be used as a priority parameter. In order to minimize the well-known curse of dimensionality issue, to which multi-agent problems are subject when considering discrete state modelings, the system is modeled based on the introduced single-dependent-agents. Based also on the single-dependent-agents concept, we introduce the Genetic TiMDP (G-TiMDP) method applied to the truck dispatching problem. This method is a hybridization of the TiMDP model and of a Genetic Algorithm (GA), which is also used to solve the truck dispatching problem. Finally, in order to evaluate and compare the results of the introduced methods, we execute Monte Carlo simulations in a example heterogeneous mine composed by 15 trucks, 3 shovels, and 1 crusher. The uncertain aspect of the problem is represented by the path selection through crusher and shovels, which is executed by the truck driver, being independent of the dispatching system. The results are compared to classical dispatching approaches (Greedy Heuristic and Minimization of Truck Cycle Times - MTCT) using Student's T-test, proving the efficiency of the introduced truck dispatching methods.
24
Taylor, Wendi Lyn. "Design of a decision support system for dynamic truck dispatching." Thesis, Georgia Institute of Technology, 1986. http://hdl.handle.net/1853/25093.
Full text
25
McCaskey, Donald Wayne. "Effective dispatching in the material requirements planning job shop /." Connect to resource, 1987. http://rave.ohiolink.edu/etdc/view.cgi?acc%5Fnum=osu1264613608.
Full text
26
Yao, Yi-Chun, and 姚怡均. "Dynamic Dispatching and Preventive Maintenance of Inequivalent Machines with Dispatching-dependent Deterioration." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/94041954283090555365.
Full textAbstract:
碩士國立臺灣大學
工業工程學研究所
105
This study uses machine health information to develop an efficient dynamic dispatching and preventive maintenance policy for inequivalent parallel machines. Inequivalent parallel machines have similar function and can process the same group of products, but the production rates could be different. In many industries, the difference of production rates between inequivalent machines is caused by deterioration of machines over time. When production rates are different among inequivalent machines between different products, a proper dispatching strategy is critical for reducing production cycle. In addition, this study also integrates preventive maintenance policy into dynamic dispatching model so as to save more waiting cost. The Dynamic Dispatching with Preventive Maintenance Model (DDPM Model) is developed and formulated with stochastic dynamic programming. The model objective is to minimize the total waiting cost. Finally, the discrete event simulation is used to verify the DDPM model of two-product and two-machine system. Compared with several traditional dispatching rules, DDPM can effectively increase average production rate and also decrease total waiting cost.
27
Liu, Geng-Gu, and 劉耿谷. "Backward simulation dispatching rule." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/54944084122895944845.
Full textAbstract:
碩士大同大學
資訊經營學系(所)
94
Quick and production runs is the trend of current manufacturing industry. How to reduce the total tardiness and minimize tardy jobs has become a major research topic and is critical to enterprise competency. There are many researches on dispatching rules of production scheduling proposing different solutions according to different situations. This thesis mainly discusses the schedule problem of Job Shop that takes into account due date and tolerant waiting time during scheduling. In order to achieve the goal, we have proposed a heuristic algorithm of Backward Sequence Forward Schedule (BSFS) which uses the backward sequence to obtain the tolerant waiting time for every operation and then proceeds the forward scheduling by making a judgment for a job and operation to be done earlier, in order to reduce the total tradiness. In this study, we also hold a comparison discussion with Bake’s Modified Due Date (MDD) proposed in 1983. From the comparison results we attempt to find out the performing characteristics regarding the total tardiness between BSFS and MDD. Because BSFS uses Due Date for ready time, during backward scheduling and it dispatching criteria is based on athe processing time of operation itself, due date has less effect on the scheduling according to our experimental results. Furthermore, adjustment among operations is more agile due to the adoption of Johnson’s rule and concept of cut-in.
28
Wu, Chieh, and 吳婕. "A study of a Fee for Providing the Dispatching Agency from Employee Dispatching Industry." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/97532489499581579950.
Full textAbstract:
碩士國立中央大學
產業經濟研究所
97
The using of employee dispatching service become more popular in Taiwan recently, it has been a mature industry in Japan and other countries. In regards of the studies related to the dispatching industry, contributions to a fee for providing the dispatching agency have remained relatively unexplored in contemporary literature. Therefore, the level of the fee for providing the dispatching agency becomes a crucial issue since it is the key determinant for the survival of employee dispatching industry in the market. The level of the fee could be seen as the price for the firm to gain “freedom.” which will affect firms’ decisions significantly whether to hire dispatched employees or not. Thus, we established a theory model and regression model to investigate the strategic of the firms to make. In addition, there are many factors influencing the level of the dispatching fee, namely the category of industry, the capital of a firm, the reasons to hire dispatched employees, the level of profession of dispatched employees, and the background of dispatched employees, which will be further discussed later. Through the empirical study in the theory and regression model, we can conclude three results: 1. Whether to hire dispatched employees: Compare to the manufacturing industry, high-tech industry and financial industry are more willing to hire the dispatched employees. Moreover, foreign-funded enterprise and larger enterprise have more willingness to accept this newly service as well. These results are consistent with the extended meaning of the theory model. 2. A fee for providing the dispatching agency: Compare to the manufacturing industry, service industry is willing to pay higher price. The length of time using dispatching service, the level of profession of the dispatched employees that meets clients’ need, capital and staff of clients are all affecting the level of fee for providing the dispatching agency. 3. “The background of dispatched employee” has no effect on the fee. However, client companies are willing to pay more while they encounter the issue that “to avoid personal matters inefficiency” and choose to hire dispatched employees.
29
Huang, Yu-Lu, and 黃友錄. "Dispatching Rules With Dedicated Machines." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/80178691213361098383.
Full textAbstract:
碩士國立交通大學
工業工程與管理學程碩士班
91
This research investigates the dispatching decisions in a semiconductor foundry fab with machine-dedication properties. Machine in a workstation may be dedicated or non-dedicated. A wafer once processed by a dedicated-machine, in the remaining operations, should be processed by the machine. The following decisions in the machine-dedication scenario are examined. How to allocate wafers to dedicated-machines? How to dispatch wafers to dedicated-machines? How to dispatch wafers to non-dedicated machines? This research proposes a decision rule for each of three decisions. Simulation experiments show that the proposed decisions outperform the current industrial practices, particularly in on-time delivery rate.
30
Goel, Asvin, and Volker Gruhn. "Collaborative Dispatching of Commercial Vehicles." 2006. https://ul.qucosa.de/id/qucosa%3A32735.
Full textAbstract:
Collaborative dispatching allows several dispatchers to view the routing solution as a dynamic model where changes to the vehicle routes can be made in real-time. In this paper we discuss implications of collaborative dispatching on real-time decision support tools for motor carriers. We present a collaborative dispatching system which uses real-time information obtained from a telematics system. Messages sent from the vehicles are automatically analysed and actual data, such as exact arrival and departure times, as well as discrepancies between actual and planned data are identified. The collaborative dispatching system not only allows several dispatchers to concurrently modify the schedule, but also a dynamic optimisation method. The optimisation method is capable of taking into account that
input data may change at any time and that dispatchers can concurrently modify the schedule and may add or relax certain constraints relevant to the optimisation model.
31
Li, Meng-ching, and 李孟青. "The Effects of AGV Dispatching on the Performances of Job Dispatching Rules in Job Shops." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/31577167672612792217.
Full textAbstract:
碩士朝陽科技大學
工業工程與管理系碩士班
96
The automation of Material Handling System (MHS) can solve the problem of increasing shortage in labor market, and in the meantime improve the efficiency and elasticity of the production systems. Automated Guided Vehicle (AGV) is common MHS equipment adopted by many companies. Past research in the literature focuses mostly on the smoothness of AGV flow, only a few addressed the interactions between AGV dispatching and job dispatching rules. Therefore, the purpose of this research is to study the effects of AGV dispatching on the performances of job dispatching rules in job shops. This study conducts a well-designed simulation experiment to discover the effects of AGV dispatching on the performances of job dispatching rules in job shops. A total of thirteen well-known dispatching rules and several AGV dispatching rules are considered. In addition to showing the interaction between them, a set of recommendations are given for the best combination of AGV and job dispatching rules under different system’s configuration and performance criteria. This study finds that, from the first stage experiment, the station-oriented AGV rules (NV, RV, and FV) do not present significant interactions with job dispatching rules. On the other hand, from the second stage experiment, the vehicle-oriented rules (NIQ and RW) can improve system’s performance, especially when the system utilization is high. Overall, the simulation results show that the best job dispatching rule is SPT when the job routing complexity is mild. However, PT +WINQ +AT is the best job dispatching rule when this routing complexity increases. The only exception is when the system has utilization is high, in that case RR rule would be the best. When routing complexity decreases, MDD outperforms others at low system utilization, and S/RMOP at high system utilization.
32
Liu, ying-jie, and 劉英傑. "Fuzzy Inference – based FMS Dynamic Dispatching." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/73283204045510786770.
Full textAbstract:
碩士國立雲林科技大學
工業工程與管理研究所碩士班
93
Due to the variety of product and rapid demand, manufacturer must have capability and flexibility to product high quality and variety of product to satisfy the customer needs. Therefore, the Flexible Manufacturing System suited for small to medium size and batch production had been developed. Under the uncertain and complex manufacturing environment, there are some variable that affect the production performance of different objectives. If the scheduling and dispatching for work order are planned with considering only one objective, the flexibility and agility for flexible manufacturing system can not be achieved, at the same time, the performance of multiple objectives can not be also achieved. In this research, a dynamic dispatching rules for multiple objectives based on fuzzy inference in proposed. First, the variables affecting the system performance are routed out. Then the fuzzy membership function and fuzzy rule database for dispatching rule are established from simulation data. The priority of each dispatching rule is decided based on the degree of influence on objective by the statues of variables. The highest priority of dispatching rules in selected to improve system performance and stability. From the simulation results the performance of the proposed fuzzy-based dynamic dispatching rules is better than fixed dispatching rules.
33
Jen-Kuen, Young, and 楊政坤. "State-Dependent Dispatching for Wafer Fabrication." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/29461547736247480054.
Full textAbstract:
碩士中原大學
工業工程研究所
86
Semiconductor manufacturing in Taiwan is growing very fast. In additionto the development in products and manufacturing technologies, operation management such as scheduling and dispatching in one way for the IC fabs to become competitive in the world market. In this research, a state-dependent dispatching (SDD) algorithm is proposed for a foundry fab. In this algorithm, three dispatching rules are usedunder different situations: TB, STNV, and FGCA. Fab equipment is first classified into bottleneck machines and non-bottleneck machines. For a bottleneck machine, different dispatching rules are used based on its queuelength. When the queue is long, a TB rule is used: select the lot with the largest WIP deviation and surplus deviation. A deviation means the differentbetween the preset threshold value and the actual value. When the queue is short, an STNV rule is used: select the lot with the shortest expected processing time until its next visit to the bottleneck machine. For a non-bottleneck machine, an FGCA rule is used: select the lot with the leastnumber of steps toward a bottleneck machine. AutoSched simulation models are built to evaluate the performance of the proposed SDD algorithms. A foundry fab with five major product types each consisting of 300 steps is studied. Simulation results show that SDD can leadto better performance measure such as cycle time and wafer in process than individual dispatching rules.
34
Huang, Sheng-Yuan, and 黃勝源. "Intelligent Dispatching Systems by Wireless Communications." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/51632073935587301051.
Full textAbstract:
碩士國立臺灣大學
資訊管理組
103
The 110-report system offers effective and immediate ways to obtain information and locate of the incident. A director should assign the optimum police force to handle or to prevent upcoming event. In this study, the theoretical framework of VPS and VCC, apply the Internet of Things, massive data analysis, and other mechanisms to confirm intelligent dispatching systems by wireless communications. Through voiceprint, fingerprint or face recognition and other methods, to identity the status and limits of authority. By iBeacon, NFC and other auxiliary sensing element to assist the equipment, in order to exchange the information. On the network side, in addition to general commercial wireless communications, such as 3G, 4G or 5G combined with self-built Wi-Fi Mesh, forming elaborate wireless network; On the aggregated information collection vehicles side, such as street parking, identifying the bus, car and license plate, and various incident occurred or examining people’s information, carefully constructed the data through analysis model to provide personnel to the scene of the incident. In order to fully grasp the situation from on-site resources to handle the cases effectively.
35
QIU, PEI-ZHUN, and 邱佩諄. "Dynamic dispatching of couriers:a simulation analysis." Thesis, 1991. http://ndltd.ncl.edu.tw/handle/38087780707793656854.
Full text
36
Chun-Shyong, Youe, and 游俊雄. "A Study on Train Dispatching Models." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/80540862297409541707.
Full textAbstract:
碩士國立成功大學
交通管理(科學)學系
82
Train travel time simulation of a mass rapid transit system usually plays an important role in scheduling. The quality of a time table will affect the operating efficiency of ATC subsystems (ATO, ATS & ATP) directly. Thus, a time table must be established according to the MRT system characteristics, and operators can find the operation bottlenecks through the simulation of it. The objective of this research is to develop a train travel simulation model to establish the time tables of MRT. In the procedure of simulation, the system characteristics including the speed limit profiles along the route and the train characteristics must be considered to determine the train travel speed and total travel time. Based on the simulation of single train movement, the model can obtain a complete train operation time table by adding the consideration of dwell times, terminal times and starting times. Through the time table, operators can evaluate the fittness of train schedule. A case study concerning the establishment of time table for all-stop and skip-stop operation in Taipei MCT were also shown in this research. It is hoped that this study will provide better understanding of the train operations and station-to-station movement in the mass rapid transit systems.
37
Wenn－Jinn，Shieh and 謝汶進. "A Study on Train Dispatching Models." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/45688712242837641250.
Full textAbstract:
碩士國立成功大學
交通管理(科學)學系
82
Taiwan government is planning and constructing some railway systems, including Taipei urban railway, high speed inter- city railway, and so on. Railway management is very important for improving the efficiency of the existing and proposed railway systems. Train dispatching plan is the very basic element in the railway traffic planning process. Its planning result creates a base to do engine scheduling, car allocation, crew scheduling, and so on. However, for a complicated railway system sush as Taiwan Railway Administration, it might take 180 man-days to find a feasible plan. For such an important and complicated work, this study attempts to investigate the practice of train dispatching, to built its mathematical models, and to solve the models numerically. Several linear mixed integer programming models have been built for the train dispatching problem, in consideration of type and order of trains, type of rail sections, and type of rail layout in a station corresponding to a model. One numerically example is created to test its capability in solving the conflicts between trains and to pursue the objective of system efficiency.
38
Min-Jung, Hung, and 洪敏蓉. "The Research on Employee Dispatching Management." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/16190329264807997606.
Full textAbstract:
碩士國立高雄應用科技大學
人力資源發展系
98
When the corporations go competition dramatically, it is the important issue that how the corporations reduce operation costs including employees cost and improve manpower flexibility. In practice, it is a new trend that enterprises adopt dispatched employment with dispatched work agency to manage human resource recently. This research takes case study methods and focuses on dispatching management by dispatching work agency. The findings of this research are as follows： The dispatching management of dispatched work agency are including risk management and operation management. In risk management, the dispatching work agency will collect environment information and adjust the operation process in order to prevent the business risk. Another, the dispatching work agency will also collect client’s environment information or cooperate with client enterprises when the manpower demand and supply are uncertainty. Moreover, in operations management, the dispatched work agency will try to gather the client enterprises’ business information, adjust operation process or cooperation modes in order to provide more efficient services to clients.
39
Chen, Chia-Ying, and 陳家盈. "A Novel Emergency Vehicle Dispatching System." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/04802285556481838864.
Full textAbstract:
碩士國立清華大學
通訊工程研究所
100
When accidents or disasters happen, emergency response time is always crucial. Most procedures in the existing emergency vehicle dispatching systems rely heavily on manual assignments. In this paper, we propose a novel emergency vehicle dispatching system to reduce emergency response time, which includes automatic emergency resource assignment and driving path planning to reduce unnecessary time delay caused by human misjudgement or the delay caused by traffic jam. As the traffic condition varies from time to time, the traffic information employed in the proposed method needs to trace back to several weeks prior to the dispatching time. Furthermore, we also propose a lane reservation scheme for emergency vehicles to minimize the crash risks. Before an emergency vehicle arrives at each road segment, Road Side Units start to disseminate the warning message at suitable time, so that other drivers could have enough time to take proper actions such as speed acceleration or switching lanes. Simulation results show that the proposed approach can largely reduce the traveling time of emergency vehicles comparing to the shortest path approach with sirens and lights to alert other drivers. With the traveling time as well as emergency resource assignment time being reduced, the emergency rescue teams would gain edges in rescuing lives and property.
40
嚴國晉. "Combined Dispatching Rules for Semiconductor Manufacturing Scheduling." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/88826789862405842655.
Full text
41
Luo, Shi-Zong, and 羅仕宗. "A Time-weighted, Hitrate-based Dispatching Method." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/48593788091645909742.
Full textAbstract:
碩士國立清華大學
工業工程與工程管理學系
90
Because of the manufacturing process complexity in semiconductor manufacturing, dispatching has been an important factor to the overall fab productivity and equipment effectiveness. Although there are numerous dispatching methodologies, almost all of them are designed from the production perspective. A great majority of them are based on the optimization of production, cycle time, equipment utilization, bottleneck machines, etc. However, from the business perspective, what counts at the end is the customer side of the story — not the internal manufacturing perspectives. The customer-driven factors such as order hit rate, profit, and customer relationship — for long-term business — are rarely considered in designing the dispatching rules. The very few researches which consider target hit rate used turn ratio to estimate the lot progress in the fab in order to control the lot processing speed. However, pure turn ratio failed to consider the great differences in the actual time needed to progress over various manufacturing stages. Using turn ratio to control the lot progress cannot accurately control the speed of the lot progress. This research attempts to optimize the dispatching integrating customer-driven perspectives — namely target hit rate. This research uses actual process time as the weight to control the target hit rate in order to more accurately control the actual lot progress. This dispatching method was compared to FIFO、GFIFO、CR、EDD、T.R and showed better hit-rate and production result compared to all the other ones.
42
戴君彥. "Dynamic State-Dependent Dispatching for Wafer Fabrication." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/73852239932470809245.
Full textAbstract:
碩士中原大學
工業工程學系
88
Semiconductor manufacturing is growing very fast. In addition to the development in products and manufacturing technologies, operation management such as releasing and dispatching is one way for the IC fab to become competitive in the market. In this research, a dynamic state-dependent dispatching (DSDD) algorithm is proposed for a foundry fab. Fab equipment is dynamically classified in to bottleneck machines when its average utilization of previous day is higher than a threshold value. For a dynamic bottleneck machine, different dispatching rules are used based on its queue length. When the queue is long, a TB+ rule is used: select the lot with the largest WIP deviation and surplus deviation. When the queue is short, an STNV rule is used: select the lot with the shortest expected processing time until its next visit to the bottleneck machine. For a dynamic non-bottleneck machine, a FGCA+ rule is used: select the lot with the least number of steps toward a bottleneck machine. Besides, three different lot release rules are studied in this research. AutoSched simulation models are built to evaluate the performance of the proposed DSDD algorithm. A foundry fab with five major product types each consisting of 300 steps is studied. Simulation results show that DSDD can lead to better performance measure such as cycle time and wafer in process than the other dispatching rules.
43
Chyuan, Lu Ching, and 盧清泉. "Aircraft Dispatching Strategy for Irregular Flight Incidents." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/44212353230015899303.
Full textAbstract:
碩士國立交通大學
交通運輸研究所
83
Airlines suffer from the perturbation of flight schedule and have paid great attention to it. Flight delays or cancellations resulting from irregular incidents occur almost every day. Therefore, how to reduce the impact of irregular incidents is critical to airlines. This thesis begins with description of the causes and characteristics of irregular incidents. These irregular incidents are then classified by available resources on the site of the incident and level of incident impact to the airline. After incident classification, a framework of aircraft dispatching strategy for irregular flight incidents was developed. Following the framework construction, a procedure to find and evaluate feasible aircraft dispatching alternatives is proposed. Aircraft swapping is one of the important components in the developed framework. Therefore, two MP models and corresponding heuristic method to solve the aircraft swapping problem are introduced. In the final, we apply the developed models to study cases with flight time tables from China Airline and Eva Air. The results show that the aircraft swapping model and the heuristic method are simple, useful and practical.
44
Tsai, Jen-Yao, and 蔡仁耀. "Heuristic Dispatching Algorithms for Yarn Dyeing Process." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/53866979965523860861.
Full textAbstract:
碩士國立交通大學
工業工程與管理系所
92
This research proposes three heuristic dispatching algorithms（Simulated annealing ,Genetic algorithms ,Tabu search）for the dyeing process in a yarn-dyed textile factory. The performances of these algorithms are verified by a real case. Special characteristics of the yarn-dyed textile industry, that have been taken into account in the development of the dispatching algorithms for dyeing process, are the following: (1) the set-up times of the dyeing machine are dependent on the sequence of jobs on the machine; (2) the tardiness of a job is dependent on the other jobs which are included in a particular pattern of customer order. The second characteristic is called “grouping delivery” The performances of three proposed algorithms have been compared with those of the traditional dispatching methods (EDD, SPT, CR), and have shown better results. Among the three proposed heuristic dispatching algorithms, Simulated annealing and Tabu search have better performances and have less computation time than Genetic Algorithms.
45
林國訓. "Dispatching Rules for Multiple Queue Time Constraints." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/74351526832466924095.
Full textAbstract:
碩士國立清華大學
工業工程與工程管理學系
92
Queue time constraint refers to constraint that the elapsed time between two processes must be contained within a set time period in order to maintain the quality of the work pieces. Although many studied queue time constraints in semiconductor manufacturing, few discussed multiple queue constraints applied on consecutive manufacturing processes. The situation appears more frequently with the introduction of recent advanced processes. The research proposed dispatching and a lot releasing methods for a section of manufacturing processes under multiple queue time and batching constraints. First, an algorithm and associated software was developed to calculated the earliest lot releasing time that can assure non-violation of queue times and satisfy lot batching requirement of the work pieces in the observed manufacturing section. Second, a dispatching method based on waiting time allocation concept, at the beginning of the manufacturing section, and FIFO method for the ensuing processes is proposed. Simulation results show that this “section-wise” dispatching method performs better to some other commonly used dispatching methods such as First-In First-Out(FIFO), Global FIFO, Earliest Due Date(EDD), and Critical Ratio(CR) methods in all three performance indices: Target hit rate, average throughput and average cycle time.
46
Liu, Ren-Hau, and 劉人豪. "Optimal Diesel Generators Dispatching Considering Wind Power." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/66shky.
Full textAbstract:
碩士大同大學
電機工程學系(所)
102
Peng-Hu, the diesel generators of phase I and II share the total net generation. Without considering diverse efficiencies of units, it will make the operating cost higher. This study will take combinations of load patterns and wind generations into account. The I/O curves of all units will be collected and analyzed. Based on the economic dispatching, the dispatching criterion will be modified. The benefit of the novel criterion is predicted to lower the operation cost, and also referred to other island systems.
47
Lin, Hsu-Yen, and 林旭彥. "Research on Public Department Establishing Dispatching Companies." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/43472178925686656285.
Full textAbstract:
碩士大葉大學
工業關係學系碩士班
92
ABSTRACT Facing fierce competition in international environment and also for the influence of labor flexibility, to reduce the cost of labor, companies all bring in dispatched human resources to solve labor requirement of short term and from non-core businesses. Consequently, the market of dispatching industry develops in Taiwan rapidly. The emergence of dispatching industry has already brought an impact on the employer-employee relationship of long-term employment, therefore, the government must accelerate its legislation aiming at the human resource market of atypical employment, to avoid affecting the stable employer-employee relationship at present. In addition, facing the high unemployment rate, the phenomenon of Post-Fordism, many related employment promotion policies of Taiwan have gradually lost balance and service institutes strengthening employment have gone against its nature, consequently, it is necessary to solve the unemployment by methods of other types, to reach the objective of safe employment system. One of the very important methods is to set up dispatching companies by private management of public establishment, since it is the trend for governmental reorganization. This method not only can help to improve economic efficiency, but also reach the purpose of saving expenses for the government. Furthermore, it can solve the requirement by companies on flexible human resources and also be used as the reference for government for the issue of unemployment rate. The main shaft of this study is the topic of public department setting up dispatching companies. First, it adopts documentation analysis, collecting discussions by scholars and experts on dispatching, private management of public establishment, and employment service system. Summarizing the functions and disputes of these three, it searches for related sub-grade information to develop the interview questions. After that, it gives in-depth interview to 23 people from 19 agencies including dispatching industry, businesses, private management of public establishment units and government agencies. Finally, it describes the problems confronted based on narrative analysis, and also provides solutions and reference for operation models. The objectives of this research include: (I) on the basis of finding out about the personnel downsizing system of government administrational renovation, discussing about the possibility for the government to establish dispatching companies by private management, to provide flexible human resources, and conform to the goal of flexibility required by labor market. (II) making a breakthrough on the present administrational system and management restriction, reaching both goals of employment settlement, enterprises and employers through the spirit of private management of public establishment. (III) integrating the attached system of private dispatching companies and government agencies handling dispatching businesses with separated responsibilities. (IV) Providing the research results as reference for the government in setting up dispatching companies of private management, to reduce unemployment rate, and solve the unemployment issue. Based on the above researches, the conclusions mainly find that problems confronted are: (I) there are two inconsistent expectations towards private management of public establishment by public department and private department; (II) there are 17 internal environmental policy orientation factors; (III) 20 external environmental/technical policy orientation factors; (IV) 7 items of review on the problems occurred during the “operation model” of private management of public establishment. In addition, it also raises research recommendations on solutions in terms of legal aspect (3 items), agreement aspect (6 items), new public management aspect strategy principles (including 5 information strategies), incentives strategies (5), trust strategies (6), quality strategies (6), risk strategies (6) etc. five categories of strategic aspect principles. Finally, it raises a further 3 items of methods and strategies in operation model aspect, and analyzes the most feasible operation model and gives recommendations on follow-up research. Keywords: private management of public establishment, dispatching industry, dispatched work agency, user enterprise, dispatched workers
48
Wei-HsiangKao and 高偉翔. "The Dispatching Problem with Total Time Constraint." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/61094051209742140262.
Full text
49
Hsieh, Wen-jen, and 謝文仁. "A Research on the Taxi Fleet Dispatching." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/03310560368466153954.
Full textAbstract:
碩士國立中央大學
工業管理研究所碩士在職專班
97
Currently taxi companies facing competition pressure of the same business companies, low taxi loading rate, economic recession . How effectively carrying on taxi dispatching to promote service quality and competitive advantage, seeking reforming to attract the consumers to travel by taking the will, increasing the taxi passenger rate and reducing the operating cost, really become important topics. It has become major trend of development of intelligent transportation system in commercial transportation about taxi operation with global satellite position system (i.e. GPS), geographic information system (i.e. GIS) and the General Packet Radio Service (i.e. GPRS). Station dispatching is an important operation model for taxi companies. Intelligent transportation system with advanced telecommunication technology could reduce the cost of low taxi loading rate, increase the operation efficiency, and increase total income. This research proposes a model to partition service areas of taxi stations and the station dispatching operation. It could reduce the rate of taxi delay in arrival, and control the arrival time become acceptable for passengers. The purpose is to reduce the rate of no show or the passengers refuse to take the taxi, increase the operation efficiency, and increase total income for this research.
50
Fang, Li-Long, and 方禮隆. "Dispatching Rule for Multiple Cycle Time Products." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/86044148499531438579.
Full textAbstract:
碩士國立交通大學
工業工程與管理系
90
This research develops a dynamic dispatching rule called Slack_Weight for IC foundries in order to improve the on-time delivery of multiple cycle time products. That is, wafer lots are assigned different manufacturing cycle time based on customers’ demands. For example, wafer lots are grouped into three classes：shorter cycle time lots、regular cycle time lots, and longer cycle time lots. Customers can place their orders with a particular cycle time and price. With considering the utilization of a machine group and the number of machines in the machine group, we classify the machine groups into three classes. Corresponding to each class, a particular value of weight is assigned to represent the waiting time of a lot in queue at a machine group. Then we sum up the values of weight of the machine groups that are used to process the remaining steps of a particular lot in queue at a certain machine group. And the slack_weight of this lot is defined by dividing the slack-time with the total weights. The processing priorities are determined by the value of slack_weight. Simulation results show that the proposed Slack_Weight dispatching rule is better than other dispatching methods in literature.