Thematische Bibliographien / Production scheduling / Dissertationen
Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Production scheduling.

Dissertationen zum Thema „Production scheduling“

Autor: Grafiati
Veröffentlicht am 4. Juni 2021
Zuletzt aktualisiert am 30. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Production scheduling" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Stephenson, Paul A. „New dominance orders for scheduling problems /“. *McMaster only, 1999.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Huang, Chueng-Chiu S. „Stochastic scheduling“. Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24834.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Moghaddam, Atefeh. „Production scheduling : unavailabitlity of resources“. Troyes, 2012. http://www.theses.fr/2012TROY0025.

Der volle Inhalt der Quelle
Annotation:
Dans le marché d’aujourd’hui, l’un des facteurs de survie les plus importants pour une entreprise est la garantie de la satisfaction des clients. Parfois, une entreprise ne peut pas satisfaire les exigences de ses clients à cause de contraintes telles que la capacité limitée ou les dates de fin strictes. Elle est donc obligée d’ignorer certaines commandes et de les rejeter ou encore de sous-traiter ces commandes. Dans les deux cas, la société est soumise à des frais. Dans cette thèse, nous étudions les différents types de ligne de production dans lesquels le rejet des commandes est possible. D’abord, nous avons étudié le problème d’ordonnancement bi-objectif sur une seule machine. Nous avons proposé une méthode exacte et plusieurs méta-heuristiques et heuristique efficaces pour trouver une bonne estimation de solutions non-dominées. Ainsi, nous avons étudié les différents concepts de dominance afin de limiter notre recherche dans la région la plus prometteuse du front de Pareto. Par la suite, nous avons étudié un problème d’ordonnancement réentrant à deux machines. Dans ce cas, le rejet des tâches a lieu en fonction de leurs dates de fin strictes. Nous avons considéré deux décisions simultanées : l’acceptation des tâches et leur ordonnancement. Un modèle de programmation linéaire mixte en nombres entiers et différents algorithmes génétiques multi-objectifs, ainsi que l’intégration des concepts de dominance divers, ont été proposés. Enfin, un problème plus général d’ordonnancement flow-shop de permutation réentrant avec dates de fin strictes et le rejet autorisé a été abordé
In today’s competitive market, one of the most important survival factors for a company is the achievement of customers’ satisfaction. Sometimes, a company can not fulfill its customers’ requirements due to the constraints such as limited capacity or tight due dates so it is obliged to ignore some orders and reject them or find another supplier to out-source those orders. In both cases, the company is charged a fee. In this thesis we investigate different types of production line in which rejection of the jobs is possible. At the beginning, we studied a variant of the problem as bi-objective single-machine scheduling problem with rejection. We proposed an exact method and some efficient metaheuristics and a heuristic to find a good estimation of non-dominated solution set. We found that in industrial case, most of the time the decision maker preferred the non-dominated solutions placed in the middle part of Pareto front. So we investigated different dominance concepts apart from Pareto in order to limit our research into the most promising region of Pareto front. Then we studied a two-machine re-entrant scheduling problem with rejection. In this case, the rejection of jobs occurred due to their strict due dates. So we examined simultaneous job acceptance and scheduling decisions. A mixed integer linear programming model and different multi-objective genetic-based algorithms were proposed by integrating various dominance concepts. Finally, a more general problem of re-entrant permutation flow-shop scheduling problem with strict due dates and rejection was tackled
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Wong, Yat-sing. „Production scheduling for virtual cellular manufacturing systems /“. Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20720841.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Cross, Fionnuala Mary. „A model for loading and sequencing a flexible manufacturing cell“. Thesis, Georgia Institute of Technology, 1986. http://hdl.handle.net/1853/25656.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Wang, Jiaxin. „Modelling and solving for production scheduling“. Doctoral thesis, Universite Libre de Bruxelles, 1996. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212411.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Lin, Neng-pai. „Master production scheduling in uncertain environments /“. Connect to resource, 1989. http://rave.ohiolink.edu/etdc/view.cgi?acc%5Fnum=osu1262714277.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

JARDIM, LEANDRO SCHOEMER. „UNDERSTANDING COMPETENCE IN PRODUCTION SCHEDULING ROUTINES“. PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2017. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34032@1.

Der volle Inhalt der Quelle
Annotation:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE SUPORTE À PÓS-GRADUAÇÃO DE INSTS. DE ENSINO
Nas organizações industriais contemporâneas, a competição global e o avanço das tecnologias de informação tornam os produtos e processos cada vez mais semelhantes. O desempenho operacional passa, então, a ser um dos principais mecanismos de diferenciação. Nesse cenário, a área de planejamento e programação da produção ganha um inédito papel estratégico. O presente estudo se propôs a investigar esse novo papel com um olhar centrado nas rotinas organizacionais e nas pessoas que exercem a função. Mais especificamente, a partir de uma abordagem qualitativa e interpretativa, o trabalho utilizou o método fenomenográfico para compreender como os programadores concebem a competência nas suas rotinas organizacionais. A análise das entrevistas identificou três diferentes concepções. A primeira está associada à tarefa de alocação eficiente de recursos e materiais. A segunda vê a programação como um processo de mediação entre as diferentes áreas da empresa. E a terceira atribui ao programador de produção a reponsabilidade de fazer a gestão estratégica da operação. Além disso, foram identificadas seis dimensões do fenômeno que explicam e diferenciam as concepções, são elas: Raciocínio lógico, Conhecimento técnico (do processo produtivo), Conhecimento sistêmico (de outras áreas), Estratégia de negociação, Aspecto manifesto da rotina e Envolvimento com a estratégia corporativa. Os achados sugerem, por fim, que a dimensão estratégica da programação é verificável, em diferentes graus, nas suas rotinas. Além disso, ao revelar a concepção competência como sendo a mediação entre as diferentes áreas da empresa, o estudo traz as estratégias de negociação para o centro do debate sobre a realização competente das rotinas de programação da produção.
In contemporary industrial organizations, global competition and the advancement of information technologies make products and processes increasingly similar. Operational performance then becomes one of the main differentiation mechanisms. In this scenario, the area of production planning and scheduling gains an unprecedented strategic role. The present study aimed to investigate this new role with a focus on the organizational routines and the people who perform them. More specifically, from a qualitative and interpretative approach, this study used phenomenography method to understand how schedulers conceive competence in their organizational routines. The analysis of the interviews identified three different conceptions. The first is associated with the task of efficient allocation of resources and materials. The second sees scheduling as a process of mediation between the different areas of the company. And the third assigns to the production planner the responsibility to do the strategic management of the enterprise operations. In addition, six dimensions of the phenomenon that explain and differentiate the conceptions are identified: Logical reasoning, Technical knowledge (of the productive process), Systemic knowledge (of other areas), Negotiation strategy, Manifested aspect of the routine and Involvement with corporate strategy. The findings suggest that the strategic dimension of scheduling is verifiable, to different degrees, in production planning routines. In addition, by revealing the concept of competence as being the mediation between the different areas of the company, the study brings negotiation strategies to the center of the debate on the competent realization of production planning routines.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Lin, Neng-Pai. „Master production scheduling in uncertain environments“. The Ohio State University, 1989. http://rave.ohiolink.edu/etdc/view?acc_num=osu1262714277.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
11

Ying, Chen-Tsau Chris. „Backward simulation for production scheduling purposes /“. The Ohio State University, 1994. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487861396025914.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
12

Woerlee, Auke Peter. „Decision support systems of production scheduling /“. Rotterdam : Erasmus universiteit, 1991. http://catalogue.bnf.fr/ark:/12148/cb37438055v.

Der volle Inhalt der Quelle
Annotation:
Proefschrift--Rotterdam--Erasmus universiteit, 1991.
Mention parallèle de titre ou de responsabilité : Beslissingsondersteunende systemen voor korte termijn produktieplanning. Résumé en néerlandais, 4 p. Ill. par l'auteur. Bibliogr. p. 151-165. Index.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
13

Borsi, John Joseph. „Cyclic scheduling with spacing constraints“. Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/25475.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
14

Albritton, Michael. „Optimal finite capacity production scheduling with random demand“. Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/26457.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
15

Wikum, Erick. „One-machine generalized precedence constrained scheduling“. Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/24937.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
16

Smith, Tristan. „Window-based project scheduling algorithms /“. view abstract or download file of text, 2004. http://wwwlib.umi.com/cr/uoregon/fullcit?p3153800.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.)--University of Oregon, 2004.
Typescript. Includes vita and abstract. Includes bibliographical references (leaves 189-198). Also available for download via the World Wide Web; free to University of Oregon users.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
17

Jiang, Yun. „A study on cyclic hoist scheduling problems /“. View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202003%20JIANG.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 135-138). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
18

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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
19

Meichsner, Thomas. „Area scheduling in operations control of large component manufacturing“. Thesis, Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/29529.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
20

王日昇 und Yat-sing Wong. „Production scheduling for virtual cellular manufacturing systems“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31239468.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
21

Pundoor, Guruprasad. „Integrated production-distribution scheduling in supply chains“. College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2583.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.) -- University of Maryland, College Park, 2005
Thesis research directed by: Business and Management. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
22

Colova, Engin. „Chocolate Production Line Scheduling: A Case Study“. Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607583/index.pdf.

Der volle Inhalt der Quelle
Annotation:
This study deals with chocolate production line scheduling. The particular production line allows producing multiple items at the same time. Another distinguishing property affecting the planning methodology is that an item can have different production capacities when produced in different product combinations which are called production patterns in this study. Planning is done on a 12 weeks rolling horizon. There are 21 products and 103 production patterns covering all the production possibilities. The subject of the study is to construct an algorithm that gives 12 weeks&rsquo
production values of each product and to construct the shift based scheduling of the first week of the planning horizon. The first part is Master Production Scheduling (MPS) and the objective is minimizing the shortage and overage costs. A mathematical modeling approach is used to solve the MPS problem. The second part is the scheduling part which aims to arrange the production patterns obtained from the MPS module within the shifts for the first week of the planning horizon considering the setup times. The MPS module is a large integer programming model. The challenge is finding a reasonable lower bound whenever possible. If it is not possible, finding a reasonable upper bound and seeking solutions better than that is the main approach. The scheduling part, after solving MPS, becomes a TSP and the setup times are sequence independent. In this part, the challenge is solving TSP with an appropriate objective function.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
23

Sun, Jun. „Development of an intelligent production scheduling system“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0016/MQ49690.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
24

刑衛國 und Weiguo Xing. „Evaluation and scheduling of private power production“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31242522.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
25

Lane, R. „A problem-solving architecture for production scheduling“. Thesis, Cranfield University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359570.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
26

Doulgeri, Z. „Production scheduling policy for flexible manufacturing systems“. Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/38292.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
27

Miller, Jeremy John. „Production scheduling in a foundry machine shop“. Master's thesis, University of Cape Town, 1986. http://hdl.handle.net/11427/21924.

Der volle Inhalt der Quelle
Annotation:
Bibliography: pages 89-92.
The scheduling of production in job shops is generally accomplished in four stages; aggregate planning, machine loading, sequencing and detailed scheduling. In industrial job shops, the number of jobs and machines makes detailed scheduling a particularly complicated and unwieldy task. When faced with this situation, a typical response of managements is to simply ignore the problem and apply some remedial action by adapting existing company operation procedures. The first objective of this dissertation is to indicate the dangers and inefficiencies which result when the problem of detailed scheduling is ignored. This is done in terms of a case study analysis in which the problems which currently exist in the machine shop at Atlantis Aluminium, a jobbing foundry, are illustrated. The second objective is to develop a systematic approach for the solution of detailed scheduling in job shops. Major steps in this approach are: i) a classification of shop scheduling problems ii) a survey of relevant scheduling literature in order to determine existing detailed scheduling techniques iii) the design of the scheduling system This approach is illustrated by applying it to the machine shop at Atlantis Aluminium.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
28

Srinivasan, Sudharshana. „Spatial Scheduling Algorithms for Production Planning Problems“. VCU Scholars Compass, 2014. http://scholarscompass.vcu.edu/etd/3406.

Der volle Inhalt der Quelle
Annotation:
Spatial resource allocation is an important consideration in shipbuilding and large-scale manufacturing industries. Spatial scheduling problems (SSP) involve the non-overlapping arrangement of jobs within a limited physical workspace such that some scheduling objective is optimized. Since jobs are heavy and occupy large areas, they cannot be moved once set up, requiring that the same contiguous units of space be assigned throughout the duration of their processing time. This adds an additional level of complexity to the general scheduling problem, due to which solving large instances of the problem becomes computationally intractable. The aim of this study is to gain a deeper understanding of the relationship between the spatial and temporal components of the problem. We exploit these acquired insights on problem characteristics to aid in devising solution procedures that perform well in practice. Much of the literature on SSP focuses on the objective of minimizing the makespan of the schedule. We concentrate our efforts towards the minimum sum of completion times objective and state several interesting results encountered in the pursuit of developing fast and reliable solution methods for this problem. Specifically, we develop mixed-integer programming models that identify groups of jobs (batches) that can be scheduled simultaneously. We identify scenarios where batching is useful and ones where batching jobs provides a solution with a worse objective function value. We present computational analysis on large instances and prove an approximation factor on the performance of this method, under certain conditions. We also provide greedy and list-scheduling heuristics for the problem and compare their objectives with the optimal solution. Based on the instances we tested for both batching and list-scheduling approaches, our assessment is that scheduling jobs similar in processing times within the same space yields good solutions. If processing times are sufficiently different, then grouping jobs together, although seemingly makes a more effective use of the space, does not necessarily result in a lower sum of completion times.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
29

Xing, Weiguo. „Evaluation and scheduling of private power production“. Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B23295338.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
30

Sun, Xiaoqing. „A modified shifting bottleneck approach to job shop scheduling with sequence dependent setups (MSBSS) /“. free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9841187.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
31

Chen, Yongjiang. „An integrated process planning and production scheduling framework for mass customization /“. View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202003%20CHENY.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 146-154). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
32

Wang, Kai, und 王恺. „Decomposition-based scheduling in flexible flow shops under uncertainties“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B45137213.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
33

Cutler, Mark Christopher. „A study of scheduling operations with preemptive jobs and global system interruptions /“. Thesis, Connect to this title online; UW restricted, 1998. http://hdl.handle.net/1773/8729.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
34

Gibson, David Riviere. „Order batching procedures“. Thesis, Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/32975.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
35

Yavuz, Mesut. „Batch production smoothing with variable setup and processing times“. [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0010066.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
36

Rashidianfar, Rezvan. „System design of an evaluation aid for jobshop scheduling heuristics“. Ohio : Ohio University, 1986. http://www.ohiolink.edu/etd/view.cgi?ohiou1183145803.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
37

Hsu, Chih-hua. „Dynamic scheduling of manufacturing systems /“. Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
38

Hung, Yee-shing Regant, und 洪宜成. „Scheduling online batching systems“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B34624016.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
39

Moon, Jeongseung. „Timing control in manufacturing and supply chains“. Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04072004-180111/unrestricted/moon%5Fjeongseung%5F200312%5Fphd.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
40

Charnprasitphon, Aphiwat. „Modeling and analysis of the batch production scheduling problem for perishable products with setup times“. Diss., Available online, Georgia Institute of Technology, 2007, 2007. http://etd.gatech.edu/theses/available/etd-01102007-183154/.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2007.
Dr. Faiz Al-Khayyal, Committee Co-Chair ; Dr. Paul M. Griffin, Committee Co-Chair ; Dr. Earl Barnes, Committee Member ; Dr. Jye-Chyi Lu, Committee Member ; Dr. John Elton, Committee Member.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
41

James, Heath A. „Scheduling in metacomputing systems /“. Title page, contents and abstract only, 1999. http://web4.library.adelaide.edu.au/theses/09PH/09phj274.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
42

Suresh, S. „Stochastic flow shop scheduling“. Diss., Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/74776.

Der volle Inhalt der Quelle
Annotation:
In this dissertation we present new results for minimizing the makespan in a flow shop with zero storage between machines. Makespan is the total length of time required to process a set of jobs. We consider m machines and n jobs with random processing times. Since there is no intermediate storage between machines, a job that has finished processing at one machine may have to stay on that machine until the next machine is free. Our goal is to select a schedule that will minimize the makespan. Our results require various stochastic orderings of the processing time distributions. Some orderings minimize the expected makespan, and some stronger results stochastically minimize the makespan. The optimum sequence of these latter cases not only minimizes the expected makespan but also maximizes the probability of completing a set of jobs by time t for any t. The last result is concerned with scheduling jobs on two identical parallel machines. The jobs are subjected to some intree precedence constraints. We resolve a conjecture that appeared in Pinedo and Weiss (1985) and give conditions under which the conjecture is true and give examples to prove that the conjecture is false in general.
Ph. D.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
43

Tai, Chia-Hung C. „A stochastic project scheduling problem with resource constraints /“. free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9842569.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
44

Hatzikonstantis, Leonidas. „Heuristic strategies for scheduling of cellular manufacturing systems“. Thesis, Imperial College London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339274.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
45

Brander, Pär. „Essays on lot scheduling in production and disassembly“. Licentiate thesis, Luleå tekniska universitet, Industriell Ekonomi, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-16963.

Der volle Inhalt der Quelle
Annotation:
This Licentiate Thesis is concerned with the lot scheduling of multiple items on a single facility, both in production and disassembly. The thesis contains an introductory overview and four research papers, entitled: I. Lot Sizes in a Capacity Constrained Facility – A simulation Study of Stationary Stochastic Demand II. Determination of Safety Stocks for Cyclic Schedules III. Lot Scheduling in a Disassembly Factory IV. Cyclic Lot Scheduling with Sequence-dependent Setups: A Heuristic for Disassembly Processes In paper I, the applicability of two deterministic lot sizing-procedures is tested in a simulation study when demands are stochastic. The paper shows that a deterministic model can be used in a practical situation where the demand rate is stationary stochastic, but the models must be complemented by a decision rule; which item to produce and when to produce it. Paper II develops a planning and control model for determination of safety stocks for cyclic schedules, both with and without idle time. The paper shows how the variance in demand during lead time can be estimated, which is used for determination of safety stocks and order-up-to levels. For systems with idle time, a control model for the decision to produce next item or idle the facility is presented. Paper III is an introduction to lot scheduling in disassembly processes. The performance of two different lot scheduling policies for the disassembly of multiple items is tested in a simulation study when setup times are sequence-dependent. It is concluded that cyclic schedules are preferable in disassembly processes with sequence-dependent setup times. In paper IV, a lot scheduling heuristic for disassembly processes with sequence-dependent setups is developed. The heuristic determines disassembly frequencies and the profitable use of the facility and results in a cyclic schedule.
Godkänd; 2004; 20061117 (ysko)
APA, Harvard, Vancouver, ISO und andere Zitierweisen
46

Coskun, Risvan. „SIMEX: A simulation-based expert production scheduling system“. Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10286.

Der volle Inhalt der Quelle
Annotation:
A good methodology for production scheduling can result in high efficiency in reducing manufacturing costs. SIMEX is an experimental simulation-based expert production scheduler developed by the author for applications in flexible flow shop systems in a dynamic factory environment. This study introduces the general framework of SIMEX. A prototype is developed on an IBM compatible PC in Prolog, MODSIM II, Visual Basic, and Visual C++ to generate feasible and acceptable schedules with a synchronous data exchange facility. In general, primary tasks of SIMEX are to meet due dates of the final products, to increase throughput by reducing the number of setups, and to reduce inventory cost in a flexible flow shop system in real time. SIMEX has also an ability to change its expert system's rule base interactively by means of a user interface. The expert system module of SIMEX allows to use heuristics, and production rules which are the simplifications that help limit the search for possible problem solutions and handling unexpected events. Simulation-based scheduler written in MODSIM II, is another module of SIMEX. It generates the schedules, repeatedly, to analyze and verify proposed design and alternatives. (Abstract shortened by UMI.)
APA, Harvard, Vancouver, ISO und andere Zitierweisen
47

sohier, emmanuel. „Modelling a Complex Production Scheduling Problem : Optimization Techniques“. Thesis, Blekinge Tekniska Högskola, Avdelningen för för interaktion och systemdesign, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2929.

Der volle Inhalt der Quelle
Annotation:
In this thesis, and complex real world problem, a sequence dependent scheduling of different product orders on a number of lines is addressed. Changeover costs occur between product orders belonging to different product groups. The operational research cycle is employed exploring different optimization techniques as mathematical modelling and heuristic approaches. The identification, implementation and demonstration of the techniques are supported with numerical results from experiments. One combination of different solution techniques is put forward. Some suggestions are done for reducing cost and increasing productivity.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
48

Lee, Tien-Li. „A heuristic algorithm for agricultural machinery production scheduling“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0003/MQ45334.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
49

Brander, Pär. „Essays on lot scheduling in production and disassembly /“. Luleå, 2004. http://epubl.luth.se/1402-1757/2004/13.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
50

Waterer, Hamish. „Polyhedral approaches to scheduling shutdowns in production planning“. Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/23362.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Production scheduling" für andere Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie