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

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1981. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND AERO. / Bibliography: leaves 105-108. / by Herve J-M Duchesne de Lamotte. / M.S.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1981. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND AERO. / Bibliography: leaves 175-176. / by Bruce Curtis Lubow. / M.S.

Este trabalho aborda o problema de programação da produção em um flexible flow line com tempos de setup. De acordo com a literatura, este ambiente pode ser considerado como um caso especial do Flow Shop com múltiplas máquinas, onde as tarefas podem saltar estágios. Neste estudo, foram analisados dois problemas: o primeiro, com tempos de setup independentes da sequência, e o segundo, com setup dependente da sequência de tarefas. Além disso, o setup das máquinas para as tarefas pode ser antecipado ou não. No primeiro caso, as máquinas de um estágio podem ser preparadas para o processamento de uma tarefa antes do seu término no estágio anterior. Se o setup não pode ser antecipado, a tarefa deve esperar o seu término no estágio de produção anterior. Este ambiente produtivo pode ser encontrado em um vasto número de indústrias tais como química, eletrônica, automotiva e têxtil. A medida de desempenho dos problemas é a duração total da programação (makespan). Este é um critério apropriado para sistemas de produção com grandes cargas de trabalho e em que a utilização dos recursos produtivos em longo prazo deve ser otimizada. O exame da literatura mostrou que há poucos estudos abordando a programação em flexible flow line. Considerando este aspecto, este trabalho apresenta heurísticas construtivas originais para a obtenção de programações apropriadas ao problema mencionado. Uma extensiva experimentação computacional foi executada para avaliar o desempenho relativo das heurísticas. Os resultados experimentais foram analisados e discutidos. / This work addresses the job scheduling on a flexible flow line with separate setup times. According to the literature, this scheduling problem can be considered as a special case of the Flow Shop with multiple machines, where the jobs may skip stages. Two modeled problems have been studied. In the first scheduling problem the setup times are sequence independent, and in the second one these times are sequence dependent. Moreover, the machine setup task can be either anticipatory or non-anticipatory. In the first case, a k-stage machine may be prepared for a job processing before its completion on the k-1 production stage. Otherwise, the setup task must wait for the job completion on the former production stage. This production environment can be found in a number of industries such as chemicals, electronics, automotive, and textiles. The performance measure of the production schedules is the makespan, that is, the total time to complete the schedule. This is an appropriate performance criterion for production systems with large workloads, and where the utilization of productive resources in the long term should be optimized. The literature examination has shown that there is a small number of studies dealing with flexible flow line scheduling. Having this in mind, this work introduces original constructive heuristics in order to obtain suitable schedules for the aforementioned scheduling problem. An extensive computational experience has been carried out in order to evaluate the relative performance of the heuristics. Experimental results are discussed.

本文分為個部分：多技能員工調問題，和集合覆蓋、裝運和劃分混合問題多面體研究，其中第一部分問題啟發我們第二部分的探。 / 首先，我們研究在一個大型機場的國際客運站中客戶服務人員的調問題。員工有同的技能和技能水平。技能定義是二維的，包括操作技能和語言能。在學模型中，我們也考慮用餐和休息時間的調和多處工作地點。我們證明該問題是NP-hard 的。我們推導出有效等式，以方計算過程。我們的學模型能夠幫助規劃者做出決策，及可計算同型的活性對業務的影響。我們的模型也可以幫助決策者計劃長遠工作調和培訓。 / 多技能人員調問題啟發我們這篇文的第二部分：集合覆蓋、裝運和劃分混合問題多面體研究。我們首先證明如覆蓋（或裝運）的等式被删去，該多面體是相當於一個放寬的裝運（或覆蓋）多面體的投影。然後我們考慮混合奇穴多面體（即是一個由覆蓋和裝運等式組成的多面體），並採用圖方法研究，通過考慮同型的等式的互動，推導出混合奇穴等式和完全描繪多面體的特徵。我們再推導出集合覆蓋和裝運混合問題的混合奇穴等式。計算結果顯示，混合奇穴等式有助於減少計算時間。我們還提供子明如何用等式幫助決策。 / This thesis is divided into two parts: Multi-Skilled Staff-Scheduling Problem and a polyhedral study on the Mixed Set Covering, Packing and Partitioning Problem, where the first part is a motivating example of the latter. / In the multi-skilled staff-scheduling problem, we study the problem of scheduling customer service agents at an international terminal of a large airport. The staff members are heterogeneous with different skills and skill levels. The skill specification is two-dimensional, defined by operational skills and language proficiency. In the mathematical model, we also consider the scheduling of meal and rest breaks, and multiple locations. The problem is shown to be NP-hard. We derive valid inequalities to speed up the computational procedure. With our mathematical model, we are able to help schedule planners make decisions and examine the impacts of different types of flexibility on the level of service provided. Our model can also help decision makers with long-term work-schedule planning. / Motivated by the staff-scheduling problem, the second part of this thesis studies the polyhedral structure of the mixed set covering, packing and partitioning problem, i.e., a problem that contains set covering, set packing and set partitioning constraints. We first study the mixed odd hole polytope, which is the polytope associated with a mixed odd hole consisting of covering and packing "edges". Adopting a graphical approach and considering the "interactions" between the different types of inequalities, we derive the mixed odd hole inequality, thereby completely characterizing the mixed odd hole polytope. We then generalize the mixed odd hole inequality for the general mixed covering and packing polytope. Computational results show that the mixed odd hole inequalities are helpful in reducing solution time. We also provide examples of problem settings in which the inequalities can be used to help decision making. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Kuo, Yong Hong. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 119-129). / Abstracts also in Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter I --- Scheduling of Multi-skilled Staff Across Multiple Locations --- p.1 / Chapter 1 --- Introduction --- p.2 / Chapter 2 --- Literature Review --- p.8 / Chapter 3 --- Mathematical Model --- p.14 / Chapter 3.1 --- Problem Formulation --- p.14 / Chapter 3.2 --- Valid Inequalities --- p.20 / Chapter 3.3 --- Shift Scheduling and Longer-Term Work-Schedule Planning --- p.21 / Chapter 4 --- Computational Studies --- p.24 / Chapter 4.1 --- Dataset and Input Parameters --- p.24 / Chapter 4.1.1 --- Staffing Requirements and Shortage Penalties --- p.24 / Chapter 4.2 --- Computational Study: Managerial Insights --- p.26 / Chapter 4.2.1 --- Effect of Three Types of Flexibility --- p.26 / Chapter 4.2.2 --- Impact of Different Types of Flexibility --- p.28 / Chapter 4.3 --- Computational Study: Benefits Compared with Benchmarks --- p.33 / Chapter 4.3.1 --- Heuristic H1: CSA Assignment by Time Period --- p.35 / Chapter 4.3.2 --- Heuristic H2: CSA Assignment by Criticality --- p.35 / Chapter 4.3.3 --- Comparison with Benchmarks --- p.37 / Chapter 4.4 --- Computational Study: Computational Efficiency --- p.40 / Chapter 5 --- Conclusions --- p.44 / Chapter II --- On the Polyhedral Structure of the Mixed Set Covering, Packing and Partitioning Polytope --- p.47 / Chapter 6 --- Introduction --- p.48 / Chapter 7 --- Preliminaries --- p.51 / Chapter 8 --- Overview of Packing, Covering and Partitioning Polyhedra --- p.58 / Chapter 8.1 --- Set Packing Polytope --- p.58 / Chapter 8.1.1 --- Intersection Graph --- p.59 / Chapter 8.1.2 --- Lifting Procedures --- p.63 / Chapter 8.1.3 --- Facet-Producing Subgraphs --- p.66 / Chapter 8.2 --- Set Covering Polytope --- p.71 / Chapter 8.2.1 --- Polyhedral Structure and the Associated Graphs --- p.71 / Chapter 8.3 --- Set Partitioning Polytope --- p.76 / Chapter 8.4 --- Blocking and Anti-Blocking Pairs --- p.78 / Chapter 8.4.1 --- Blocking polyhedra --- p.78 / Chapter 8.4.2 --- Anti-blocking polyhedra --- p.80 / Chapter 8.5 --- Perfect, Ideal and Balanced Matrices --- p.81 / Chapter 8.5.1 --- Perfect Matrices --- p.81 / Chapter 8.5.2 --- Ideal Matrices --- p.83 / Chapter 8.5.3 --- Balanced Matrices --- p.84 / Chapter 9 --- Mixed Set Covering, Packing and Partitioning Polytope --- p.87 / Chapter 9.1 --- Mixed Set Partitioning and Covering/Packing Polytope --- p.87 / Chapter 9.2 --- Mixed Set Covering and Packing Polytope --- p.88 / Chapter 9.2.1 --- Mixed odd hole --- p.90 / Chapter 9.2.2 --- General Mixed Covering and Packing Polytope --- p.97 / Chapter 9.3 --- Computational Experiments --- p.108 / Chapter 9.4 --- Applications of the Mixed Odd Hole Inequality --- p.112 / Chapter 9.4.1 --- Railway Time-Tabling --- p.112 / Chapter 9.4.2 --- Team Formation --- p.113 / Chapter 9.4.3 --- Course Registration --- p.114 / Chapter 10 --- Conclusions --- p.117 / Bibliography --- p.119

Made available in DSpace on 2015-04-22T22:10:50Z (GMT). No. of bitstreams: 1 diego.pdf: 1646868 bytes, checksum: 184608f031ef1b7a63b685a26977dde9 (MD5) Previous issue date: 2010-10-29 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This paper presents a model for programming calibration services balance, applied to a calibration laboratory installed in the city of Manaus, in order to promote improvements in the management of productive capacity. The calibration of the measuring instrument is part of the metrological services that support enterprises that have a quality management system certificate. The proposed model, seeking to align itself with these management practices, adopts the structure of the mapping process organized phases input, processing and output. The research method used to construct the model is the literature in the areas of production management, service management and metrology. This consultation revealed some difficulties because the approach is relatively new in the service area. In this context, we surveyed the main features present in any operation targeting the sort of service calibration laboratory. The classification was established by combining the characteristics of the activities of front line service represented by the calibration scale and the rear of activities by managing the laboratory calibration, resulting in framing shop services based on the volume of customers served by day at the plant. In our case, the high degree of standardization and repeatability in this provision of the calibration scale, facilitated the use of tools of production planning and control, through the technical choice of sequencing of work orders and their proper calibration schedule, being pulled to the type selected. To evaluate this process were investigated performance measures consistent with the service sector, revealing management indicators applicable in the following the calibration of instruments. The results contributed to increasing productivity in services researched, reflecting the adoption of certain management practices based on principles of production system used in the manufacturing area. / Este trabalho apresenta um modelo para programação dos serviços de calibração de balança, aplicado a um laboratório de calibração instalado na cidade de Manaus, com o objetivo de promover melhorias na gestão da capacidade produtiva. A calibração de instrumento de medição faz parte dos serviços de metrologia que dão suporte às empresas que possuem um sistema de gestão da qualidade certificado. O modelo proposto, buscando alinhar-se com essas práticas de gestão, adota a estrutura do mapeamento de processo organizado nas fases entrada, transformação e saídas. O método de pesquisa utilizado para construir o modelo foi o bibliográfico nas áreas de administração da produção, gestão de serviços e metrologia. Essa consulta revelou algumas dificuldades devido à abordagem ser relativamente nova na área de serviços. Nesse contexto, foram pesquisadas as principais características presentes em qualquer operação visando classificar os serviços do laboratório de calibração. A classificação foi estabelecida ao combinar as características das atividades de linha de frente representada pelo serviço de calibração de balança e as atividades de retaguarda por meio do gerenciamento do laboratório de calibração, resultando no enquadramento de loja de serviços com base no volume de clientes atendidos por dia na unidade produtiva. No caso estudado, o alto grau de padronização e repetitividade presente na prestação do serviço calibração de balança facilitaram o uso de ferramentas de planejamento e controle da produção, através da escolha da técnica de sequenciamento das ordens de serviços de calibração e sua devida programação, sendo a do tipo puxada selecionada. Para avaliar esse processo foram pesquisadas medidas de desempenho compatíveis com o setor de serviços, revelando indicadores gerenciais aplicáveis no seguimento de calibração de instrumentos. Os resultados obtidos contribuíram para o aumento da produtividade no setor de serviços pesquisado, refletindo a adoção de algumas práticas de gerenciamento baseado em princípios do sistema da produção utilizados na área de manufatura.

Cellular manufacturing, which is also referred to as group technology among researchers, has primarily been used as a means to increase productivity, efficiency and flexibility. Under group technology, similar jobs, which have similar shape, material, and processing operations are assigned to the same group. Moreover, dissimilar machines are assigned to the same cell to meet the processing requirements of jobs in a group or multiple groups. Group scheduling problems have been studied extensively in the past as implementation of group technology became more prevalent in industry. However, most of the work that has been done has focused on single-criterion optimization. A bi-criteria group scheduling problem in a flow shop with sequence-dependent setup time is investigated in this research. Cellular manufacturing and flow shop are two popular scenarios in industry. To mimic real industry practice, dynamic job releases and dynamic machine availabilities are assumed. The goal is to minimize the weighted sum of total weighted completion time and total weighted tardiness, which satisfy the producer and customer goals separately. Normalized weights are assigned to both criteria to describe the trade-off between the two goals. Two different initial solution finding mechanisms are proposed, and a tabu-search based two-level search algorithm is developed to find near optimal solutions for the problem. An example problem is used to demonstrate the applicability of the search algorithm. A mathematical model is developed and implemented to evaluate the quality of the solutions obtained from the heuristics in small problem instances. Further, to uncover the difference in performance of initial solution finding mechanisms and heuristics, a detailed experimental design is performed. The results show that different heuristics have different performance in solving problems generated with different parameters. / Graduation date: 2012

by James B. Orlin. / Includes bibliographical references (leaf 25). / Supported in part by the U.S. Army Research Office. DAAG29-80-C-0061

Stanley B. Gershwin, Ramakrishna Akella, and Yong Choong. / Bibliography: p. 36. / "February, 1984." / Contract DAAK11-82-K-0018.

Thesis (Ph. D.)--Ohio State University, 1984. / Includes bibliographical references (leaves 171-177). Available online via OhioLINK's ETD Center.