Spelling suggestions: "subject:"explainingmathematical models"" "subject:"packingmathematical models""
31 |
Essays on public infrastructure, industrial location and regional developmentHe, Yumei, 何玉梅. January 2008 (has links)
published_or_final_version / abstract / Economics and Finance / Doctoral / Doctor of Philosophy
|
32 |
Heuristic strategies for the single-item lot-sizing problem with convex variable production costLiu, Xin, 劉忻 January 2006 (has links)
published_or_final_version / abstract / Industrial and Manufacturing Systems Engineering / Master / Master of Philosophy
|
33 |
'n Beplanningsmodel vir maatskaplike verantwoordelikheid in Anglo American Corporation - Wesrandstreek09 February 2015 (has links)
M.A. (Social Work) / Please refer to full text to view abstract
|
34 |
Hybrid model for optimization of cost operations for a university transit serviceUnknown Date (has links)
The demand on transportation infrastructure is dramatically increasing due to population growth causing the transportation systems to be pushed to their limits. With the projected population growth, not only for the U.S. but especially for the higher education field, university campuses are of great importance for transportation engineers. Urban univeristy campuses are considered major trip generators and with the population forecast many challenges are bound to arise. The implementation of an improved transit system provides a lower-cost solution to the continuously increasing congestion problems in university campus road networks and surrounding areas. This paper presents a methodology focused on the development of a hybrid system concentrated in three main aspects of transit functionality : access to bus stop location, reasonable travel time and low cost. Two methods for bus stop locations assessment are presented for two levels of analysis : microscopic and mesoscopic. The resulting travel time from the improved bus stop locations is analyzed and compared to the initial conditions by using a microsimulation platform. The development of a mathematical model targets the overall system's cost minimization, including user and operator cost, while maximizing the service coverage. The results demonstrate the benefits of the bus stop assessment by the two applied methods, as well as, the benefits of the route and headway selection based on the mathematical model. Moreover, the results indicate that the generation of routes using travel time as the impedance factor generates the optimal possible routes to obtain the minimum system's overall cost. / by Alicia Benazir Portal Palomo. / Thesis (M.S.C.S.)--Florida Atlantic University, 2012. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2012. Mode of access: World Wide Web.
|
35 |
Optimization of bus system characteristics in urban areas under normal and emergency conditionsUnknown Date (has links)
Catastrophic events in the past revealed the need for more research in the field of emergency evacuation. During such a procedure, different problems such as congestion at the related traffic networks because of the large number of the evacuating vehicles can occur. Current best practices, in order to deal with such problems, suggest the further involvement of buses in evacuation operations. On the first part of this study after the accurate development of the related simulation model, the optimization of a selected bus system characteristics focusing on the vehicle routing parameter will follow through the development and the application of a non-linear cost minimization problem. On the second part, the potential use of the regular-everyday bus routes in a no-notice emergency evacuation in order to save time comparing to the time needed so as to assign the actual evacuation routes to the evacuation bus vehicles will be analyzed. / by Ioannis Psarros. / Thesis (M.S.C.S.)--Florida Atlantic University, 2012. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2012. Mode of access: World Wide Web.
|
36 |
Hierarchical production planning for discrete event manufacturing systems.January 1996 (has links)
Ngo-Tai Fong. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 158-168). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Manufacturing Systems: An Overview --- p.1 / Chapter 1.2 --- Previous Research --- p.3 / Chapter 1.3 --- Motivation --- p.5 / Chapter 1.4 --- Outline of the Thesis --- p.8 / Chapter 2 --- Preliminaries --- p.11 / Chapter 2.1 --- Problem Formulation: Deterministic Production Planning --- p.11 / Chapter 2.2 --- Markov Chain --- p.15 / Chapter 2.3 --- Problem Formulation: Stochastic Production Planning --- p.18 / Chapter 2.4 --- Some Lemmas --- p.24 / Chapter 3 --- Open-Loop Production Planning in Stochastic Flowshops --- p.26 / Chapter 3.1 --- Introduction --- p.26 / Chapter 3.2 --- Limiting Problem --- p.29 / Chapter 3.3 --- Weak-Lipschitz Continuity --- p.34 / Chapter 3.4 --- Constraint Domain Approximation --- p.41 / Chapter 3.5 --- Asymptotic Analysis: Initial States in Sε --- p.47 / Chapter 3.6 --- Asymptotic Analysis: Initial States in S \ Sε --- p.61 / Chapter 3.7 --- Concluding Remarks --- p.70 / Chapter 4 --- Feedback Production Planning in Deterministic Flowshops --- p.72 / Chapter 4.1 --- Introduction --- p.72 / Chapter 4.2 --- Assumptions --- p.75 / Chapter 4.3 --- Optimal Feedback Controls --- p.76 / Chapter 4.3.1 --- The Case c1 < c2+ --- p.78 / Chapter 4.3.2 --- The Case c1 ≥ c2+ --- p.83 / Chapter 4.4 --- Concluding Remarks --- p.88 / Chapter 5 --- Feedback Production Planning in Stochastic Flowshops --- p.90 / Chapter 5.1 --- Introduction --- p.90 / Chapter 5.2 --- Original and Limiting Problems --- p.91 / Chapter 5.3 --- Asymptotic Optimal Feedback Controls for pε --- p.97 / Chapter 5.3.1 --- The Case c1 < c2+ --- p.97 / Chapter 5.3.2 --- The Case c1 ≥ c2+ --- p.118 / Chapter 5.4 --- Concluding Remarks --- p.124 / Chapter 6 --- Computational Evaluation of Hierarchical Controls --- p.126 / Chapter 6.1 --- Introduction --- p.126 / Chapter 6.2 --- The Problem and Control Policies under Consideration --- p.128 / Chapter 6.2.1 --- The Problem --- p.128 / Chapter 6.2.2 --- Hierarchical Control (HC) --- p.131 / Chapter 6.2.3 --- Kanban Control (KC) --- p.133 / Chapter 6.2.4 --- Two-Boundary Control (TBC) --- p.137 / Chapter 6.2.5 --- "Similarities and Differences between HC, KC, and TBC" --- p.141 / Chapter 6.3 --- Computational Results --- p.142 / Chapter 6.4 --- Comparison of HC with Other Polices --- p.145 / Chapter 6.5 --- Concluding Remarks --- p.151 / Chapter 7 --- Conclusions and Future Research --- p.153 / Bibliography --- p.158
|
37 |
Slack based production policies and their applications in semiconductor manufacturing.January 1999 (has links)
by Chu Kwok-Fai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 91-93). / Abstracts in English and Chinese. / List of Figures --- p.vii / List of Tables --- p.viii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- Literature Review --- p.4 / Chapter 1.2.1 --- Ordinary Dispatching Policies --- p.5 / Chapter 1.2.2 --- Setup-oriented Dispatching Policies --- p.7 / Chapter 1.3 --- Organization of Thesis --- p.10 / Chapter 2 --- Slack Based Policies --- p.11 / Chapter 2.1 --- Definition of Slack --- p.12 / Chapter 2.2 --- Least Slack Policy (LS) --- p.13 / Chapter 2.3 --- Least Weighted Slack Policy (LWS) --- p.15 / Chapter 2.3.1 --- Definition of Weighted Slack --- p.15 / Chapter 2.3.2 --- Policy Mechanism and Discussion --- p.15 / Chapter 2.4 --- Least Mean Slack Policy (LMS) --- p.16 / Chapter 2.4.1 --- Batch Size and Its Lower Bound --- p.16 / Chapter 2.4.2 --- Policy Mechanism and Discussion --- p.17 / Chapter 2.5 --- Least Weighted Mean Slack Policy (LWMS) --- p.18 / Chapter 2.5.1 --- Definition of Weighted Mean Slack --- p.18 / Chapter 2.5.2 --- Policy Mechanism and Discussion --- p.18 / Chapter 2.6 --- Illustrative Example --- p.21 / Chapter 2.7 --- Due-date Window Expansion --- p.24 / Chapter 2.7.1 --- Due-date Window --- p.24 / Chapter 2.7.2 --- LWMS Policy: Due Date Window Expansion --- p.25 / Chapter 3 --- Simulation Study --- p.27 / Chapter 3.1 --- Models Description --- p.27 / Chapter 3.1.1 --- Two-Machines-Two-Products Model --- p.27 / Chapter 3.1.2 --- Assembly Lines Model --- p.29 / Chapter 3.1.3 --- Micro-Chips Testing Model --- p.31 / Chapter 3.2 --- Simulation Experiment Description --- p.32 / Chapter 4 --- Simulation Result and Analysis --- p.38 / Chapter 4.1 --- Simulation Result --- p.39 / Chapter 4.1.1 --- Two-Machines-Two-Products Model --- p.39 / Chapter 4.1.2 --- Assembly Lines Model --- p.39 / Chapter 4.1.3 --- Micro-Chips Testing Model --- p.43 / Chapter 4.2 --- Statistical Analysis --- p.44 / Chapter 4.2.1 --- Significance of Weighted Factor and Batch Size --- p.44 / Chapter 4.2.2 --- Comparison Among Different Policies --- p.46 / Chapter 4.3 --- Discussion of Results --- p.50 / Chapter 5 --- An Experimental Implementation and Conclusion Remarks --- p.51 / Chapter A --- Reducing MCT and SDCT by LS policy --- p.55 / Chapter A.1 --- Reducing Variance of Lateness --- p.55 / Chapter A.2 --- Reducing Variance of Cycle Time --- p.56 / Chapter A.3 --- Reducing Mean Cycle Time --- p.56 / Chapter B --- Complete Simulation Result --- p.58 / Chapter B.1 --- Two-Machines-Two-Products Model --- p.58 / Chapter B.1.1 --- "Wip, Batch Size and Throughput" --- p.58 / Chapter B.1.2 --- MCT and SDCT --- p.62 / Chapter B.1.3 --- Machine Utilization --- p.66 / Chapter B.2 --- Assembly Lines Model --- p.68 / Chapter B.2.1 --- "WIP, Batch Size and Throughput" --- p.68 / Chapter B.2.2 --- MCT and SDCT --- p.70 / Chapter B.2.3 --- Machine Utilization --- p.73 / Chapter B.3 --- Micro-Chips Testing Model --- p.82 / Chapter B.3.1 --- "WIP, Throughput, MCT and SDCT" --- p.82 / Chapter B.3.2 --- Machine Utilization --- p.84 / Chapter C --- MANOVA studies on Weighted Factor and Batch Size --- p.86 / Chapter C.1 --- Two-Machines-Two-Products Model --- p.86 / Chapter C.1.1 --- Least Weighted Slack Policy --- p.86 / Chapter C.1.2 --- Least Mean Slack Policy --- p.87 / Chapter C.1.3 --- Least Weighted Mean Slack Policy --- p.87 / Chapter C.2 --- Assembly Lines Model --- p.88 / Chapter C.2.1 --- Least Weighted Slack Policy --- p.88 / Chapter C.2.2 --- Least Mean Slack Policy --- p.88 / Chapter C.2.3 --- Least Weighted Mean Slack Policy --- p.89 / Chapter C.3 --- Micro-Chips Testing Model --- p.89 / Chapter C.3.1 --- Least Weighted Slack Policy --- p.89 / Chapter C.3.2 --- Least Mean Slack Policy --- p.90 / Chapter C.3.3 --- Least Weighted Mean Slack Policy --- p.90 / Bibliography --- p.91
|
38 |
Transportation networks equilibration with discrete choice models.Sheffi, Yosef, 1948- January 1978 (has links)
Thesis. 1978. Ph.D.--Massachusetts Institute of Technology. Dept. of Civil Engineering. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography: p. 119-124. / Ph.D.
|
39 |
Simplified methods in transportation analysisTsygalnitzky, Serge Michel January 1977 (has links)
Thesis. 1977. M.S.--Massachusetts Institute of Technology. Dept. of Civil Engineering. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography: leaf 121. / by Serge Tsygalnitzky. / M.S.
|
40 |
Manpower allocation problem with heterogeneous skills.January 2010 (has links)
Kuo, Yong Hong. / "August 2010." / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (p. 130-133). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Ground Staff Allocation at Airports --- p.4 / Chapter 2.1 --- Background --- p.4 / Chapter 2.2 --- Literature Review --- p.8 / Chapter 2.3 --- Model --- p.12 / Chapter 2.3.1 --- Notation --- p.13 / Chapter 2.3.2 --- Basic Model --- p.17 / Chapter 2.3.3 --- Model Structure --- p.20 / Chapter 2.3.4 --- Definition of Tasks --- p.22 / Chapter 2.3.5 --- Job x Language Model --- p.25 / Chapter 2.3.6 --- Job + Language Model --- p.27 / Chapter 2.4 --- Methodology --- p.35 / Chapter 2.4.1 --- Branch-and-Cut Algorithm --- p.36 / Chapter 2.4.2 --- Constraint-Driven Approach --- p.40 / Chapter 2.5 --- Optimization Tool --- p.51 / Chapter 2.6 --- Computational Results --- p.53 / Chapter 2.6.1 --- Branch-and-Cut Algorithm --- p.53 / Chapter 2.6.2 --- Constraint-Driven Approach --- p.59 / Chapter 2.7 --- Conclusions and Future Work --- p.64 / Chapter 3 --- Staff Scheduling in Emergency Departments --- p.67 / Chapter 3.1 --- Background --- p.67 / Chapter 3.1.1 --- Patient Flows --- p.69 / Chapter 3.1.2 --- Doctor Duties --- p.71 / Chapter 3.2 --- Simulation Model --- p.72 / Chapter 3.2.1 --- Assumptions --- p.73 / Chapter 3.2.2 --- Event-Scheduling --- p.74 / Chapter 3.2.3 --- Arrival Events --- p.80 / Chapter 3.2.4 --- Service Activities --- p.82 / Chapter 3.2.5 --- Paperwork-Processing --- p.84 / Chapter 3.2.6 --- Impact of Doctors' Schedules --- p.85 / Chapter 3.3 --- Parameter Estimation --- p.87 / Chapter 3.3.1 --- Data Scarcity --- p.87 / Chapter 3.3.2 --- Estimation of Service Time Distributions --- p.87 / Chapter 3.3.3 --- Search Procedure for Parameter Estimation --- p.90 / Chapter 3.3.4 --- Parameter Estimation by Descent Method --- p.91 / Chapter 3.3.5 --- Parameter Estimation by Simulated An- nealing --- p.93 / Chapter 3.4 --- Data Analysis and Simulated Results --- p.97 / Chapter 3.5 --- Conclusions and Future Work --- p.114 / Chapter A --- Mathematical Proofs --- p.116 / Chapter B --- Getting Started with the Manpower Optimization Tool --- p.122 / Chapter B.l --- Required Files or Programs --- p.122 / Chapter B.2 --- Input Parameters --- p.123 / Chapter B.3 --- Operational Tasks --- p.125 / Chapter B.4 --- Language Requirements --- p.126 / Chapter B.5 --- Flight Schedules --- p.126 / Chapter B.6 --- Availabilities of Workers --- p.128 / Chapter B.7 --- Staff Assignments --- p.128 / Bibliography --- p.130
|
Page generated in 0.1359 seconds