To see the other types of publications on this topic, follow the link: Scheduling.
Dissertations / Theses on the topic 'Scheduling'
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 'Scheduling.'
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
Paulus, J. J. "Online scheduling & project scheduling." Enschede : University of Twente [Host], 2009. http://doc.utwente.nl/60453.
Full text
2
Abd, Rahmin Nor Aliza Binti. "Online scheduling in hospital theatre scheduling." Thesis, University of Southampton, 2018. https://eprints.soton.ac.uk/427362/.
Full textAbstract:
Increasing population across all age groups has contributed to the increasing demand for health care especially those that require surgeries, thus putting more pressure on hospitals. The inability to provide adequate and efficient treatment as a result of resource constraints causes patients to wait longer for treatment. Waiting for treatment due to unavailability of an operating theatre can result in both deteriorating health and inconvenience. It is even more frustrating when the scheduled operation is cancelled because some slots is used for emergency patients or the scheduled operations are longer that planned. When such situation occurs, some patients need to be rescheduled. To resolve this problem, an operating theatre scheduling for emergency and regular patients is considered. We consider the single operating theatre problem across multiple days together with the multiple operating theatres problem on a single day. The aim is to minimise the cost incurred when patients need to be rescheduled as well as ensure minimal delay and rescheduling. We develop a model and design an algorithm to schedule operations for patients, taking into account their urgency. Patients' urgency depends on their respective situation and changes depend on several factors. Tackling the problem of scheduling single operating theatre, we use a heuristic method to provide a starting solution before applying local search and simulating annealing. The schedule is updated daily to take into account variations from planned durations and the arrival of emergency patients. The rescheduling of patients may be necessary. We consider the priority of patients and ensure that top priority patients be considered first in the scheduling and less important patients can be rescheduled if necessary. Under the local search technique, we swap every pair of patients if they satisfy the conditions imposed. After the patients are swapped, we check the total cost of the swap and compare it with the current cost. If the new total cost is less than the current cost, the swap will be finalised. We then consider the next patient until all remaining patients in the list are accounted for and we come out with the new list of schedule. Continuing from that, we utilise simulating annealing technique where we calculate the difference of the total cost (total new cost - total current cost), Δ between a pair of patients that we plan to swap. With this approach, as opposed to the local search procedure, even when the di↵erence of the total cost is positive, swapping might still take place but only with a certain probability. Besides single operating theatre, we also consider the scheduling of multiple operation theatres in a single day. Rather than using the algorithm technique, we propose an integer programming model, the Zero-One Programming model and develop an algorithm that utilises the model in scheduling multiple parallel OTs. If a surgery runs longer that expected or an emergency patient arrived into the system, patients can be moved between the available OTs to ensure that surgeries can still be performed; or if the model decides it is better to reschedule therefore the patients will be rescheduled to the next day. In order to test the efficiency of our models and look at the compatibility of the models with our algorithm, data are generated with different parameters to see if our proposed models have the ability to lower cost as well as prevent delays and rescheduling. Moreover, we check the computational time of our algorithm to ascertain whether it can provide solutions within a short amount of time. Overall, our models show improvement in reducing cost and minimising delay and rescheduling.
3
Gould, Rebecca (Rebecca L. ). "Program scheduling : decreasing flow by back-scheduling." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/104396.
Full textAbstract:
Thesis: M.B.A., Massachusetts Institute of Technology, Sloan School of Management, 2016. In conjunction with the Leaders for Global Operations Program at MIT.<br>Thesis: S.M. in Engineering Systems, Massachusetts Institute of Technology, School of Engineering, Institute for Data, Systems, and Society, 2016. In conjunction with the Leaders for Global Operations Program at MIT.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (page 74).<br>The Boeing 737 program has announced that they will continue to increase their production rate from 42 airplanes per month to eventually 52 airplanes per month. In order for the field to accommodate the increased production rates, opportunities are being considered for decreasing airplane production flow and the increasing capacity in the field. This thesis focuses on the opportunity for decreasing schedule flow through improvements in the scheduling process. Currently the field constraints do not heavily influence what order the planes roll out of the factory. This causes the field to deal with constraint variation by addressing the airplane schedule flow in order to make delivery. This thesis contributes to focusing on improving the scheduling process by driving more information being shared upstream in the decision making process and therefore decreasing the number of days needed to prepare the airplane for delivery.<br>by Rebecca Gould.<br>M.B.A.<br>S.M. in Engineering Systems
4
Lazarević, Aleksandar. "Autonomous grid scheduling using probabilistic job runtime scheduling." Thesis, University College London (University of London), 2008. http://discovery.ucl.ac.uk/7987/.
Full textAbstract:
Computational Grids are evolving into a global, service-oriented architecture – a universal platform for delivering future computational services to a range of applications of varying complexity and resource requirements. The thesis focuses on developing a new scheduling model for general-purpose, utility clusters based on the concept of user requested job completion deadlines. In such a system, a user would be able to request each job to finish by a certain deadline, and possibly to a certain monetary cost. Implementing deadline scheduling is dependent on the ability to predict the execution time of each queued job, and on an adaptive scheduling algorithm able to use those predictions to maximise deadline adherence. The thesis proposes novel solutions to these two problems and documents their implementation in a largely autonomous and self-managing way. The starting point of the work is an extensive analysis of a representative Grid workload revealing consistent workflow patterns, usage cycles and correlations between the execution times of jobs and its properties commonly collected by the Grid middleware for accounting purposes. An automated approach is proposed to identify these dependencies and use them to partition the highly variable workload into subsets of more consistent and predictable behaviour. A range of time-series forecasting models, applied in this context for the first time, were used to model the job execution times as a function of their historical behaviour and associated properties. Based on the resulting predictions of job runtimes a novel scheduling algorithm is able to estimate the latest job start time necessary to meet the requested deadline and sort the queue accordingly to minimise the amount of deadline overrun. The testing of the proposed approach was done using the actual job trace collected from a production Grid facility. The best performing execution time predictor (the auto-regressive moving average method) coupled to workload partitioning based on three simultaneous job properties returned the median absolute percentage error centroid of only 4.75%. This level of prediction accuracy enabled the proposed deadline scheduling method to reduce the average deadline overrun time ten-fold compared to the benchmark batch scheduler. Overall, the thesis demonstrates that deadline scheduling of computational jobs on the Grid is achievable using statistical forecasting of job execution times based on historical information. The proposed approach is easily implementable, substantially self-managing and better matched to the human workflow making it well suited for implementation in the utility Grids of the future.
5
Magalhaes, Marcus Vinicius De Oliveira. "Refinery scheduling." Thesis, Imperial College London, 2004. http://hdl.handle.net/10044/1/8420.
Full text
6
Hoffman, Torrey Luke. "Cache scheduling." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ34489.pdf.
Full text
7
Raman, Rajiv. "Chromatic scheduling." Diss., University of Iowa, 2007. http://ir.uiowa.edu/etd/156.
Full text
8
Huang, Chueng-Chiu S. "Stochastic scheduling." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24834.
Full text
9
Thorpe, J. C. "Vehicle scheduling." Thesis, University of Manchester, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.488397.
Full text
10
Das, Abhishek. "Stream scheduling /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Full text
11
Hanus, Deborah. "Smart scheduling : optimizing Tilera's process scheduling via reinforcement learning." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/85423.
Full textAbstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 45-48).<br>As multicore processors become more prevalent, system complexities are increasing. It is no longer practical for an average programmer to balance all of the system constraints to ensure that the system will always perform optimally. One apparent solution to managing these resources efficiently is to design a self-aware system that utilizes machine learning to optimally manage its own resources and tune its own parameters. Tilera is a multicore processor architecture designed to highly scalable. The aim of the proposed project is to use reinforcement learning to develop a reward function that will enable the Tilera's scheduler to tune its own parameters. By enabling the parameters to come from the system's "reward function," we aim eliminate the burden on the programmer to produce these parameters. Our contribution to this aim is a library of reinforcement learning functions, borrowed from Sutton and Barto (1998) [35], and a lightweight benchmark, capable of modifying processor affinities. When combined, these two tools should provide a sound basis for Tilera's scheduler to tune its own parameters. Furthermore, this thesis describes how this combination may effectively be done and explores several manually tuned processor affinities. The results of this exploration demonstrates the necessity of an autonomously-tuned scheduler.<br>by Deborah Hanus.<br>M. Eng.
12
Khamooshi, H. "Heuristic network-based project scheduling : dynamic priority scheduling method; DPSM." Thesis, Lancaster University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267918.
Full text
13
Andrews, Matthew. "Scheduling techniques for packet routing, load, balancing and disk scheduling." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42692.
Full text
14
Kampmeyer, Thomas. "Cyclic scheduling problems." Doctoral thesis, [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980566215.
Full text
15
Evans, John. "Project scheduling tool." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1997. http://handle.dtic.mil/100.2/ADA341531.
Full textAbstract:
Thesis (M.S. in Software Engineering) Naval Postgraduate School, September 1997.<br>"September 1997." Thesis advisor(s): Valdis Berzins. Includes bibliographical references (p. 245). Also available online.
16
Herrmann, Jan. "Supply chain scheduling." Wiesbaden Gabler, 2009. http://d-nb.info/999948970/04.
Full text
17
Yao, Xiaoqiang. "Pattern-recognition scheduling." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1177698616.
Full text
18
Black, Richard John. "Explicit network scheduling." Thesis, University of Cambridge, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339741.
Full text
19
Brown, Peter Derek. "Optimal irrigation scheduling." Thesis, University of Canterbury. Civil and Natural Resources Engineering, 2008. http://hdl.handle.net/10092/1255.
Full textAbstract:
An optimal stochastic multi-crop irrigation scheduling algorithm was developed which was able to incorporate complex farm system models, and constraints on daily and seasonal water use, with the objective of maximising farm profit. This scheduling method included a complex farm simulation model in the objective function, used decision variables to describe general management decisions, and used a custom heuristic method for optimisation. Existing optimal schedulers generally use stochastic dynamic programming which relies on time independence of all parameters except state variables, thereby requiring over-simplistic crop models. An alternative scheduling method was therefore proposed which allows for the inclusion of complex farm system models. Climate stochastic properties are modelled within the objective function through the simulation of several years of historical data. The decoupling of the optimiser from the objective function allows easy interchanging of farm model components. The custom heuristic method, definition of decision variables, and use of the Markov chain equation (relating an irrigation management strategy to mean water use) considerably increases optimisation efficiency. The custom heuristic method used simulated annealing with continuous variables. Two extensions to this method were the efficient incorporation of equality constraints and utilisation of population information. A case study comparison between the simulated annealing scheduler and scheduling using stochastic dynamic programming, using a simplistic crop model, showed that the two methods resulted in similar performance. This demonstrates the ability of the simulated annealing scheduler to produce close to optimal schedules. A second case study demonstrates the ability of the simulated annealing scheduler to incorporate complex farm system models by including the FarmWi$e model by CSIRO in the objective function. This case study indicates that under conditions of limited seasonal water, the simulated annealing scheduler increases pasture yield returns by an average of 10%, compared with scheduling irrigation using best management practice. Alternatively expressed, this corresponds to a 20-25% reduction in seasonal water use (given no change in yield return).
20
Prosser, Patrick. "Distributed asynchronous scheduling." Thesis, University of Strathclyde, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296921.
Full text
21
Ramahi, Muhannad Hasan. "Resident Scheduling Problem." Thesis, Virginia Tech, 1998. http://hdl.handle.net/10919/37057.
Full textAbstract:
This thesis is concerned with the Resident Scheduling Problem (RSP) in which a good schedule is desired that will meet both departmental requirements and residents' preferences. Three scenarios that represent most situations and account for various departmental requirements and needs are described. Although similar scheduling problems are considered in the literature, no analysis exists that adequately deals with this specific problem. The problem is modeled as a mixed-integer program (MIP) and heuristic solution procedures are developed for the different identified scheduling scenarios. These procedures exploit the network structure of the problem which is an important feature that enhances problem solvability. For the sake of comparison, the problem is also solved exactly via the CPLEX-MIP package. The contribution of this work is important since many hospitals are still utilizing manual techniques in preparing their own schedules, expending considerable effort and time with less scheduling flexibility.<br>Master of Science
22
Hung, Rudy Ka Yiu. "Hierarchical workforce scheduling." Case Western Reserve University School of Graduate Studies / OhioLINK, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=case1054821964.
Full text
23
Cai, Qingbo. "Layered Multicast Scheduling." Case Western Reserve University School of Graduate Studies / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=case1205436479.
Full text
24
Grosche, Tobias. "Integrated airline scheduling." [S.l. : s.n.], 2007. http://swbplus.bsz-bw.de/bsz284310352inh.htm.
Full text
25
Palmer, Andrew W. "Belief Space Scheduling." Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14280.
Full textAbstract:
This thesis develops the belief space scheduling framework for scheduling under uncertainty in Stochastic Collection and Replenishment (SCAR) scenarios. SCAR scenarios involve the transportation of a resource such as fuel to agents operating in the field. Key characteristics of this scenario are persistent operation of the agents, and consideration of uncertainty. Belief space scheduling performs optimisation on probability distributions describing the state of the system. It consists of three major components---estimation of the current system state given uncertain sensor readings, prediction of the future state given a schedule of tasks, and optimisation of the schedule of the replenishing agents. The state estimation problem is complicated by a number of constraints that act on the state. A novel extension of the truncated Kalman Filter is developed for soft constraints that have uncertainty described by a Gaussian distribution. This is shown to outperform existing estimation methods, striking a balance between the high uncertainty of methods that ignore the constraints and the overconfidence of methods that ignore the uncertainty of the constraints. To predict the future state of the system, a novel analytical, continuous-time framework is proposed. This framework uses multiple Gaussian approximations to propagate the probability distributions describing the system state into the future. It is compared with a Monte Carlo framework and is shown to provide similar discrimination performance while computing, in most cases, orders of magnitude faster. Finally, several branch and bound tree search methods are developed for the optimisation problem. These methods focus optimisation efforts on earlier tasks within a model predictive control-like framework. Combined with the estimation and prediction methods, these are shown to outperform existing approaches.
26
Riahi, Vahid. "Constraint Directed Scheduling." Thesis, Griffith University, 2019. http://hdl.handle.net/10072/386545.
Full textAbstract:
Scheduling is a decision-making process, which is employed to allocate resources to
tasks in a given time. Scheduling problems are in general NP-hard. In order to solve
scheduling problems, three common types of methods have been used: exact methods
(e.g., branch & bound and dynamic programming), population based metaheuristics
(e.g., genetic algorithm and ant colony optimisation), and local search (LS) algorithms
(e.g., simulated annealing and iterated local search). Exact methods are not able to
address the practical-sized problems effectively with regard to both CPU times and
solution quality. LS algorithms have recently attracted much more attention because of
their simplicity, being easy to implement, robustness, and high effectiveness. However,
the available LS algorithms in the literature typically use a generic structure for speci fic
problems. In other words, the biggest disadvantage of those methods is the lack of
problem speci fic components into their algorithmic structures. To ll in this gap, in this
thesis, we consider constraint-based local search (CBLS) algorithms to solve scheduling
problems because of their effectiveness and also because they are not used much in the
scheduling literature. The key difference of CBLS with other LS algorithms is in the use
of the problem specifi c information in the search process. CBLS helps the search focus
more on areas where efforts will bring more effect, and thus increase the scalability of
the search. In other words, CBLS attempts to exploit the essence of the problem and,
based on the speci ficities of the problem, defi nes the procedures that will guide the
search towards better local optima. The effectiveness of our proposed CBLS techniques is shown throughout this thesis by solving several scheduling problems, such as flowshops with blocking constraints, aircraft operations, and customer order problems.
The first scheduling problem is permutation flowshop scheduling problem (PFSP). It is one of the most thoroughly studied scheduling problems. However, mixed blocking
PFSP (MBPFSP) is a generalised and more realistic version of PFSP with real-life
applications such as cider industry. MBPFSP is an important branch of `zero capacity
buffer' scheduling problems. The second scheduling problem is aircraft scheduling
problem (ASP). ASP involves allocation of aircraft to runways for arrival and departure flights, minimising total delays. In this thesis, we focus on both single-runway and
multiple-runway ASP cases. The third scheduling problem is customer order scheduling
problem (COSP), which has many applications including the pharmaceutical industries
and the paper industries.
All of the three above-mentioned scheduling problems are NP-hard. They have made
signi ficant progress in recent years. However, within practical time limits, existing algorithms
still either find low quality solutions or struggle with practical-sized problems.
In this thesis, we aim to advance their search by better exploiting the problem speci fic
structural knowledge, extracted from the constraints and the objective functions. We
run our experiments on a range of respective standard benchmark problem instances.
Experimental results and comprehensive analyses show that our new algorithms signi ficantly outperform respective state-of-the-art scheduling algorithms.<br>Thesis (PhD Doctorate)<br>Doctor of Philosophy (PhD)<br>Inst Integrated&IntelligentSys<br>Science, Environment, Engineering and Technology<br>Full Text
27
Granfeldt, Caroline. "Rotating Workforce Scheduling." Thesis, Linköpings universitet, Optimeringslära, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-122507.
Full textAbstract:
Several industries use what is called rotating workforce scheduling. This often means that employees are needed around the clock seven days a week, and that they have a schedule which repeats itself after some weeks. This thesis gives an introduction to this kind of scheduling and presents a review of previous work done in the field. Two different optimization models for rotating workforce scheduling are formulated and compared, and some examples are created to demonstrate how the addition of soft constraints to the models affects the scheduling outcome. Two large realistic cases, with constraints commonly used in many industries, are then presented. The schedules are in these cases analyzed in depth and evaluated. One of the models excelled as it provides good results within a short time limit and it appears to be a worthy candidate for rotating workforce scheduling.
28
Stephenson, Paul A. "New dominance orders for scheduling problems /." *McMaster only, 1999.
Find full text
29
Attri, Hitesh. "An agent based manufacturing scheduling module for Advanced Planning and Scheduling." Thesis, Virginia Tech, 2005. http://hdl.handle.net/10919/31586.
Full textAbstract:
A software agents based manufacturing scheduling module for Advanced Planning and Scheduling (APS) is presented. The problem considered is scheduling of jobs with multiple operations, distinct operation processing times, arrival times, and due dates in a job shop environment. Sequence dependent setups are also considered. The additional constraints of material and resource availability are also taken into consideration. The scheduling is to be considered in integration with production planning. The production plans can be changed dynamically and the schedule is to be generated to reflect the appropriate changes. The design of a generic multi-agent framework which is domain independent along with algorithms that are used by the agents is also discussed.<br>Master of Science
30
Anapalli, Sukumar Reddy Mr. "Static Scheduling and Rotation Scheduling on Cyclo Static Data Flow Graphs." University of Akron / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=akron1246908859.
Full text
31
Huang, Wei. "Scheduling of batch processing plants : constraint model and computer scheduling system." Thesis, Loughborough University, 2003. https://dspace.lboro.ac.uk/2134/7592.
Full textAbstract:
In the process industries batch processing plants are attracting attentions because of their suitability for the manufacturing of small-volume, high-value added products. Pipeless batch plants have also been developed and built to increase plant flexibility to adapt to fast market change. Scheduling batch plants by using computer-aided systems is important for improving the plant productivity since it harmonizes the entire plant operation efficiently to achieve production goals. However, the current scheduling approaches for batch plants are inadequate, particularly for pipeless plants. The main objective of this study is to develop a general-purpose methodology to solve a common class of scheduling problems for batch plants including pipeless plants. This research involves the creation of a general scheduling model based on constraint satisfaction techniques (CST) and the development of a scheduling system that applies the model. The model comprises of three parts, which are concerned with production scheduling, integrating routing and scheduling in pipeless plants, and rescheduling. Production scheduling considers many process constrains on time and resource allocation. One of the novel aspects is to consider finite wait time constraints that limit the unstable intermediate materials to stay in the storage and processing units to a finite time. Another novel aspect is to consider integrating routing and scheduling in pipeless plants. A planning process is applied to generate a possible route between two stations and the feasibility of the route is checked by the scheduling process in which the transfer time and track allocation constraints are imposed. If conflicts take place, the system backtracks to find another route. Recovery-based rescheduling constraints are also proposed in the model to deal with resource breakdown and they can ensure the failed resource cannot be used during its failure period and what has been done before the failure remains unchanged. Plant layout is considered when a pipeless plant is rescheduled. A prototype scheduling system, Batch Processing Scheduler (BPS), was developed in C++ to apply the constraint model based on CST. A number of examples are devised to investigate the performance of the constraint model and BPS, and their feasibility and limitations are demonstrated by the results.
32
Hino, Rei, and Ryosuke Kataoka. "Cyclic Scheduling and Re-scheduling in Response to Change of Product Mix." IEEE, 2010. http://hdl.handle.net/2237/14485.
Full text
33
Allam, S. I. G. "Planning and scheduling : A new model for planning and scheduling construction projects." Thesis, Henley Business School, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373950.
Full text
34
Puppin, Diego 1976. "Convergent scheduling : a flexible and extensible scheduling framework for clustered VLIW architectures." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87852.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2003.<br>Includes bibliographical references (p. 81-84).<br>by Diego Puppin.<br>S.M.
35
Yang, Bibo. "Models and algorithms for operations scheduling problems with resource flexibility and schedule disruptions." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0006344.
Full text
36
Hung, Yee-shing Regant. "Scheduling online batching systems." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B34624016.
Full text
37
Carney, Donald P. "Application-aware resource scheduling /." View online version; access limited to Brown University users, 2005. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:3174582.
Full text
38
Kiciroglu, Ahmet. "Scheduling With Discounted Costs." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1208321/index.pdf.
Full textAbstract:
Majority of the studies in the scheduling literature is devoted to time based performance measures. In this thesis, we develop a model that considers monetary issues in single machine scheduling environments. We assume all the jobs should be completed by a common due date. An early revenue is earned if the completion time is before or on the due date, and a tardy revenue is gained if the job is completed after the due date. We consider restricted and unrestricted due date versions of the problem. Our objective is the maximization of the net present value of all revenues.
We first investigate some special cases of the problem, and present polynomial time algorithms to solve them. Then, we develop branch and bound algorithms with lower and upper bounding mechanisms. Computational experiments have shown that the branch and bound algorithms can solve large-sized problems in reasonable times.
39
King, Brett. "Optimal mine scheduling policies." Thesis, Imperial College London, 2000. http://hdl.handle.net/10044/1/8458.
Full text
40
Ghodsi, Reza. "Project scheduling using simulation." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0001/MQ35014.pdf.
Full text
41
Xu, Zusheng. "Automatically scheduling database utilities." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ63394.pdf.
Full text
42
James, Heath A. "Scheduling in metacomputing systems /." Title page, contents and abstract only, 1999. http://web4.library.adelaide.edu.au/theses/09PH/09phj274.pdf.
Full text
43
Vestjens, Adrianus Petrus Antonius. "On-line machine scheduling /." Eindhoven : Techn. Univ. Eindhoven, 1997. http://www.gbv.de/dms/goettingen/242206816.pdf.
Full text
44
Dzeko, Jasmin. "Scheduling of Norrköping Airport." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-91328.
Full textAbstract:
För att Securitas AB skall kunna behålla sin position i Norrköping Flygplats är det viktigt att de effektiviserar sin bemanning och scheman. Detta krävs för att kunna uppnå kostnadsreduceringar som skall i sin tur ge dem konkurrensfördelar för att behålla sin position vid årliga upphandlingar som sker mellan kommun och flygplats. För att effektivisera sin bemanning och scheman skall teoretiska delar användas för att styra grupper och verksamheten bättre, teoretiska delarna är i form av schemaläggningsprinciper. Vid en effektivisering av verksamheten skall en optimeringsmodell användas med flera funktioner som möjliggör en heltäckande optimeringslösning för att generera den mest kostnadseffektivaste bemanningen för schemaläggningen. Ett tekniskt system som ett informationssystem skall även strukturera Securitas arbete effektivare med en bättre bokföring över de anställda samt underlätta tillämpningen av ett standardiserat arbetssätt. Vikten av ett standardiserat arbetssätt behandlas mycket inom LEAN-filosofin och anses viktig i detta fall för att få de teoretiska delarna och informationssystemet att fungera ihop. En schemaläggningsprincip som rekommenderas att Securitas använder är perceptuell kontroll teori eftersom den har visat sig framgångsrik av företag som tillämpat den. Lösningen till Securitas problem är en kombination av teori och kvantitativa metoder som det går att räkna på. Optimeringsmodellen och informationssystemet skall tillsammans med schemaläggningsprinciperna skapa bättre förutsättningar för Securitas att sätta upp ett nytt optimalt schema som skall reducera kostnaderna med 10 % och öka effektiviteten för Securitas verksamhet i flygplatsen. Detta skall leda till en högre lönsamhet och att Securitas behåller sin position i Norrköping Flygplats vid årliga upphandlingar.<br>For Securitas AB case to maintain their position in Norrkoping Airport is it important to effectives their staffing and schedules. This is required to achieve cost reductions which will in turn give them the competitive edge to maintain their position at the annual contracts concluded between the municipality and the airport. To effectives their staffing and schedules are theoretical parts going to be used to control their groups and business better. The theoretical parts are in the form of scheduling principles. At the streamlining of operations is an optimization model going to be used that has several features that enable a comprehensive optimization solution to embarrass the most costeffective staffing for the schedule planning. A technical system as an information system will also be used to structure Securitas work more efficiently with a better accounting of the employees and to facilitate the implementation of a standardized approach. The importance of standardized work is treated much in the LEAN philosophy and is considered important in this case to obtain the theoretical aspects and the information system to work together smoothly. A scheduling policy that is recommended that Securitas uses is the Perceptual Control Theory as it has proven to be successful by companies that applied it. The solution to Securitas Problem is a combination of theory and quantitative methods that can be used to count on. Optimization model and information system will together with the scheduling principles create better conditions for Securitas to set up a new optimal schedule to reduce costs by 10 % and increase the efficiency for Securitas operations in the airport. These actions are going to lead to higher profitability and will result that Securitas wins the annual procurements in Norrkoping Airport.
45
Xu, Hua. "Scheduling with flexible parallelism." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/23388.
Full text
46
McCormick, Gregory. "Pump scheduling under uncertainty." Thesis, Brunel University, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268976.
Full text
47
Burke, Peter. "Scheduling in dynamic environments." Thesis, University of Strathclyde, 1989. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=21291.
Full textAbstract:
Much of the work in the area of automated scheduling systems is based on the assumption that the intended execution environment is static and deterministic. The work presented in this thesis is motivated by recognition of the fact that most real world scheduling environments are dynamic and stochastic. It views the scheduling task as one of satisfaction rather than optimisation, and maintenance over creation. This thesis reviews existing work in the area and identifies an opportunity to combine recent advances in scheduling technology with the power of distributed processing. Within a suitable problem-solving architecture it is argued that this combination can help to address the fundamental problems of execudonal uncertainty, conflicting objectives and combinatorial complexity. A scheduling system, DAS, which employs such a problem-solving architecture, is presented. It is distributed, asynchronous and hierarchical, and requires careful management of problem-solving effort. DAS adopts an opportunistic approach to problem-solving and the management of problem-solving effort. The mechanisms which manage problem-solving effort within DAS are also presented. In conclusion it is argued that the architecture and mechanisms presented lend themselves very well to the view taken of the scheduling task.
48
Fraser, Stephen Nicholas. "Adaptive optimal telescope scheduling." Thesis, Liverpool John Moores University, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.570885.
Full textAbstract:
Astronomical telescopes operate in a dynamic and uncertain operational environment. Time is often oversubscribed with programs competing for available slots and the best observing conditions. In order to achieve a high scientific return a scheduler must be able to create a globally optimal observing schedule. In dynamic environments any offline or static schedule will become rapidly out-of- date, thus iterative repair based or dynamic despatch scheduling is the preferred option being able to respond quickly to such changes. Dynamic despatch suffers from myopism. Long term global aims are usurped in favor of local optimization, namely what is best to do right now. Using data collected from external and embedded instrumentation I investigate and characterize the scheduler's operating environment and investigate tech- niques for short term prediction. I investigate metrics for characterizing the value of schedules both locally (at the decision point) and over longer horizons. Using this information an extensible software architecture is designed incorporating a simulation framework to allow a variety of schedulers to be implemented. Experiments are performed using the scheduler component architecture and simulation framework to determine the effects on schedule quality of environmental stability, disruptive events and reliability of prediction under a range of load conditions. Ultimately these show that where conditions are relatively stable there is an advantage to using longer look-ahead horizons but that where conditions are unstable or disruptive a basic despatch scheduler achieves results as good or better. A look-ahead scheduler with a horizon of 4 hours can give an improvement of upto 26% over a simple despatch scheduler when seeing remains stable over a period of up to 6 hours. When the loading is high, further experiments show that look-ahead schedulers can achieve better quality than despatching. As load (measured by con- tention) is increased from 1 to 25 (a reasonable range), performance of a despatcher increases by upto 17% while for a look-ahead scheduler with 4 hour horizon it can increase by upto 23%. In the experiments the look-ahead scheduler has an advantage of between 10% and 14% over the despatcher over this range of loads. Under disruptive conditions (breaks in the normal execution of the schedule) due to weather or mechanical problems, it was found that a large number of small disruptions has a more negative effect on schedule quality than a few long events. The despatcher was unaffected by these disruptions while the look-ahead sched- uler under-performed by as much as 11 % relative to the despatcher and upto 22% relative to its own performance under non-disruptive conditions which were typ- ically 14% better than the despatcher. When new observations are being added to the pool during schedule execution it was found that a look-ahead scheduler could loose out on the potential gains of adding high quality observations if the lead-time for these observations was small compared to the scheduler's look-ahead horizon. Typically the highest gain occurs where the lead-time is of the order of the look-ahead horizon. The amount of gain also decreases for longer horizons. This loss can be up to 40% for long (4 hour) horizon and as little as a few percent for a horizon of 30 minutes. For very short lead-time observations, the loss of potential reward can increases for longer horizons. For a 4 hour horizon as much as 80% of the potential gain can be lost. Under such conditions, the addition of a sequestration mechanism by means of which newly arriving high quality urgent observations can be added into an executing schedule are shown to improve the performance of look-ahead schedulers by upto 8.8% with a look-ahead horizon of 4 hours but with little effect for shorter horizons. Further experiments have shown that when determining the length of look- ahead horizon, if we either over or under-estimate the duration of stable con- ditions we obtain poorer results. When the stability length is severely under- estimated a loss of between 5% and 17% in quality was found to occur. The optimum situation appears to be when the horizon is of order the stability length. Where the stability length is over-estimated by a factor 2, a loss of 5% to 10% can occur.
49
Beckman, Philip J. "Scheduling attack submarine deployments." Thesis, Monterey, California. Naval Postgraduate School, 1997. http://hdl.handle.net/10945/8944.
Full textAbstract:
Approved for public release; distribution is unlimited<br>The Navy's peacetime mission is "to conduct forward presence operations to help shape the strategic environment by deterring conflict, building interoperability, and by responding, as necessary, to fast breaking crises with the demonstration and application of credible combat power." (OPNAV INSTRUCTION 3501.316, February 1995) The ability to carry out this mission hinges on the Navy's ability to maintain ships and submarines forward deployed in regions where such crises may occur. The end of the Cold War and current budget constraints have caused a drawdown in the number of ships and submarines with which to provide forward presence. Coupled with the continued requirement to maintain a certain level of forward presence, this drawdown creates shortfalls when attempting to deploy ships or submarines to fill certain mission requirements. To minimize these shortfalls, this thesis formulates the problem of scheduling attack submarine deployments as an integer program. Due to its size and complexity, heuristic algorithms are developed to provide near-optimai solutions in a reasonable amount of time. In addition to providing near-optimal deployment schedules, results from the algorithms are also useful in evaluating changes in maintenance and operational policies.
50
Hung, Yee-shing Regant, and 洪宜成. "Scheduling online batching systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B34624016.
Full text