Se connecter

Bibliographies thématiques / Flexible job-shop scheduling / Thèses

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Flexible job-shop scheduling.

Thèses sur le sujet « Flexible job-shop scheduling »

Auteur : Grafiati

Publié le 3 juin 2025

Mis à jour le 31 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 47 meilleures thèses pour votre recherche sur le sujet « Flexible job-shop scheduling ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.

1

Struijker, Boudier Ivar. "Job shop scheduling with flexible maintenance planning." Thesis, Lancaster University, 2017. http://eprints.lancs.ac.uk/87305/.

Texte intégral

Résumé :

This thesis considers the scheduling challenges encountered at a particular facility in the nuclear industry. The scheduling problem is modelled as a variant of the job shop scheduling problem. Important aspects of the considered problem include the scheduling of jobs with both soft and hard due dates, and the integration of maintenance planning with job scheduling. Two variants of the scheduling problem are considered: The first variant makes the classic job shop assumption of infinite queueing capacity at each machine, while such queueing capacity is non-existent in the second variant. Witho

Styles APA, Harvard, Vancouver, ISO, etc.

2

Balci, Serife Aytug. "Solution Approaches For Flexible Job Shop Scheduling Problems." Master's thesis, METU, 2013. http://etd.lib.metu.edu.tr/upload/12615676/index.pdf.

Texte intégral

Résumé :

discrete parts manufacturing industries. We are motivated by the production environment of Roketsan Missiles Industries Incorporation, operating at Turkish defense industry. Our objective is to minimize the total weighted completion times of the jobs in the system. We formulate the problem as a mixed integer linear program and find that our model could find optimal solutions only to small sized problem instances. For medium and large sized problem instances, we develop heuristic algorithms with high quality approximate solutions in reasonable solution time. Our proposed heuristic algorithm has

Styles APA, Harvard, Vancouver, ISO, etc.

3

Wu, Zuobao. "Multi-agent workload control and flexible job shop scheduling." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001193.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Sousa, Sandra Isabel Ferreira de. "Heuristic approaches for a flexible job-shop scheduling problem." Master's thesis, Universidade de Aveiro, 2016. http://hdl.handle.net/10773/17578.

Texte intégral

Résumé :

Mestrado em Engenharia e Gestão Industrial<br>Este trabalho aborda um novo tipo de problema de escalonamento que pode ser encontrado em várias aplicações do mundo-real, principalmente na indústria transformadora. Em relação à configuração do shop floor, o problema pode ser classificado como flexible job-shop, onde os trabalhos podem ter diferentes rotas ao longo dos recursos e as suas operações têm um conjunto de recursos onde podem ser realizadas. Outras características de processamento abordadas são: datas possíveis de início, restrições de precedência (entre operações de um mesmo trabalho o

Styles APA, Harvard, Vancouver, ISO, etc.

5

Al-Hinai, Nasr. "OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS." Flexible Services and Manufacturing Journal, 2011. http://hdl.handle.net/1993/4955.

Texte intégral

Résumé :

Flexible job-shop scheduling problem (FJSP) is a generalization of the classical job-shop scheduling problem (JSP). It takes shape when alternative production routing is allowed in the classical job-shop. However, production scheduling becomes very complex as the number of jobs, operations, parts and machines increases. Until recently, scheduling problems were studied assuming that all of the problem parameters are known beforehand. However, such assumption does not reflect the reality as accidents and unforeseen incidents happen in real manufacturing systems. Thus, an optimal schedule that is

Styles APA, Harvard, Vancouver, ISO, etc.

6

Luscombe, Ruth. "A dynamic real time scheduling methodology for the emergency department." Thesis, Queensland University of Technology, 2015. https://eprints.qut.edu.au/86505/1/Ruth_Luscombe_Thesis.pdf.

Texte intégral

Résumé :

This project constructs a scheduling solution for the Emergency Department. The schedules are generated in real-time to adapt to new patient arrivals and changing conditions. An integrated scheduling formulation assigns patients to beds and treatment tasks to resources. The schedule efficiency is assessed using waiting time and total care time experienced by patients. The solution algorithm incorporates dispatch rules, meta-heuristics and a new extended disjunctive graph formulation which provide high quality solutions in a fast time-frame for real time decision support. This algorithm can

Styles APA, Harvard, Vancouver, ISO, etc.

7

Müller, Gilberto Irajá. "Utilização da busca Tabu para a geração de um modelo aplicado ao Job-shop scheduling problem considerando um sistema de manufatura flexível." Universidade do Vale do Rio do Sinos, 2006. http://www.repositorio.jesuita.org.br/handle/UNISINOS/2215.

Texte intégral

Résumé :

Made available in DSpace on 2015-03-05T13:56:58Z (GMT). No. of bitstreams: 0 Previous issue date: 20<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>Este trabalho tem como objetivo a geração de um modelo de escalonamento aplicado ao Jobshop Scheduling Problem num Sistema de Manufatura Flexível que considera o tempo total de produção (makespan), o tempo total de atraso, o tempo total parado e o tempo total ocioso.O modelo proposto é composto por: (a) uma função objetivo que reflete, através de suas variáveis de decisão e seus pesos respectivos, as estratégias de otimizaçã

Styles APA, Harvard, Vancouver, ISO, etc.

8

ONORI, RICCARDO. "Managing distributed flexible manufacturing systems." Doctoral thesis, Università degli Studi di Roma "Tor Vergata", 2005. http://hdl.handle.net/2108/181.

Texte intégral

Résumé :

Per molti anni la ricerca scientifica si è concentrata sui diversi aspetti di gestione dei sistemi manifatturieri, dall’ottimizzazione dei singoli processi produttivi, fino alla gestione delle più complesse imprese virtuali. Tuttavia molti aspetti inerenti il coordinamento e il controllo, ancora presentano problematiche rilevanti in ambito industriale e temi di ricerca aperti. L’applicazione di tecnologie avanzate e di strumenti informatici evoluti non riesce da sola a garantire il successo nelle funzioni di controllo e di integrazione. Al fine di ottenere un alto grado di efficienza, è

Styles APA, Harvard, Vancouver, ISO, etc.

9

Moreira, Andreza Cristina Beezão. "O problema de minimização de trocas de ferramentas." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-06012017-104534/.

Texte intégral

Résumé :

Especialmente nas últimas quatro décadas, muitos estudos se voltaram às variáveis determinantes para a implementação efetiva de sistemas flexíveis de manufatura, tais como seu design, sequenciamento e controle. Neste ínterim, o manejo apropriado do conjunto de ferramentas necessárias para a fabricação de um respectivo lote de produtos foi destacado como fator crucial no desempenho do sistema de produção como um todo. Neste trabalho, abordamos a otimização do número de inserções e remoções de ferramentas no magazine de uma ou mais máquinas numericamente controladas, admitindo-se que uma parcela

Styles APA, Harvard, Vancouver, ISO, etc.

10

Grobler, Jacomine. "Particle swarm optimization and differential evolution for multi-objective multiple machine scheduling." Diss., Pretoria : [s.n.], 2009. http://upetd.up.ac.za/thesis/available/etd-05062009-164124/.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

11

Rodrigues, Antonio Gabriel. "Análise do comportamento dos tempos de produção em um sistema de manufatura flexível em um problema de escalonamento em um job shop: abordagem utilizando conceito de caminho crítico." Universidade do Vale do Rio do Sinos, 2007. http://www.repositorio.jesuita.org.br/handle/UNISINOS/2241.

Texte intégral

Résumé :

Made available in DSpace on 2015-03-05T13:58:26Z (GMT). No. of bitstreams: 0 Previous issue date: 1<br>Universidade do Vale do Rio dos Sinos<br>Neste trabalho é abordado o Problema de Escalonamento em um job shop, considerando restrições de datas de entrega, turnos de produção e tempo de setup entre operações. Considera-se um ambiente de Sistema de Manufatura flexível, que dado ao alto nível de automação, permite a previsibilidade dos processos de carregamento dos recursos à área de processamento. O problema foi modelado através de uma Função Objetivo fn composta de três variáveis de dec

Styles APA, Harvard, Vancouver, ISO, etc.

12

Zhang, Qiao. "Contribution à l'ordonnancement d'ateliers avec ressources de transports." Phd thesis, Université de Technologie de Belfort-Montbeliard, 2012. http://tel.archives-ouvertes.fr/tel-00909927.

Texte intégral

Résumé :

Nos travaux concernent l'étude d'une extension d'un problème d'ordonnancement bien connu sous l'appellation job shop. Nous appelons cette extension le General Flexible Job Shop Scheduling Problem (GFJSSP). Celui-ci se rencontre dans différents types d'ateliers ayant comme caractéristique commune d'être soumis à des contraintes dues à des ressources de transport. Le GFJSSP se caractérise par l'intégration de machines et robots flexibles. Le terme General induit par ailleurs la présence de robots dont la capacité est supposée unitaire dans notre étude, des temps opératoires bornés, et la possibi

Styles APA, Harvard, Vancouver, ISO, etc.

13

Melo, Everton Luiz de. "Meta-heurísticas Iterated Local Search, GRASP e Artificial Bee Colony aplicadas ao Job Shop Flexível para minimização do atraso total." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-15122014-002717/.

Texte intégral

Résumé :

O ambiente de produção abordado neste trabalho é o Job Shop Flexível (JSF), uma generalização do Job Shop (JS). O problema de programação de tarefas, ou jobs, no ambiente JS é classificado por Garey; Johnson e Sethi (1976) como NP-Difícil e o JSF é, no mínimo, tão difícil quanto o JS. O JSF é composto por um conjunto de jobs, cada qual constituído por operações. Cada operação deve ser processada individualmente, sem interrupção, em uma única máquina de um subconjunto de máquinas habilitadas. O principal critério de desempenho considerado é a minimização dos atrasos dos jobs. São apresentados m

Styles APA, Harvard, Vancouver, ISO, etc.

14

Martins, Sara Patrícia Sousa Dias. "Escalonamento do serviço laboratorial do Instituto dos Vinhos do Douro e do Porto, I.P.: uma heurística de apoio à decisão." Master's thesis, Universidade de Aveiro, 2017. http://hdl.handle.net/10773/23048.

Texte intégral

Résumé :

Mestrado em Engenharia e Gestão Industrial<br>O presente projeto insere-se num serviço laboratorial onde são executados diversos tipos de análises de vinhos com o propósito de certificar e controlar os produtos da região do Douro. O projeto em estudo retrata um caso particular dos problemas de escalonamento, Flexible Job-Shop Scheduling Problem (FJSSP), com uma complexidade acrescida devido à diversidade de análises, equipamentos e rotas que coexistem no shopfloor. A metodologia utilizada para a resolução do problema em estudo compreende o desenvolvimento, e programação, de uma heurística cons

Styles APA, Harvard, Vancouver, ISO, etc.

15

Baral, Ansuman. "Flexible job shop scheduling operation." Thesis, 2014. http://ethesis.nitrkl.ac.in/6495/1/110ME0280-11.pdf.

Texte intégral

Résumé :

When a large number of jobs and machines are taken into account, efficiency in the Job shop scheduling plays an essential role. In case of classical job shop scheduling, an operation is allowed to be processed by any machine from a given set and the FJSP is an extension of the classical job shop scheduling problem. The problem consists of two steps, one is to assign each operation to a machine and the second is to sequence the operations on the machines, such that the maximum completion time (makespan) of all operations is minimized. Many heuristics methods are designed as solutions with a clo

Styles APA, Harvard, Vancouver, ISO, etc.

16

Lin, Hsiao-Jou, and 林孝柔. "Flexible Job Shop Scheduling using a Multiobjective Memetic Algorithm." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/51223601763201114988.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

17

Chun-LiangLin and 林峻良. "An Optimal Genetic Algorithm for Flexible Job-shop Scheduling Problem." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/42010597635424812847.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

18

Huang, Wen-Chou, and 黃文洲. "Evolutionary Algorithms for Multi-Objective Flexible Job Shop Scheduling Problems." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/33530092299336882539.

Texte intégral

Résumé :

碩士<br>元智大學<br>工業工程與管理學系<br>98<br>Scheduling problems occur in many production systems, since it is necessary to distribute and sequence the work among many jobs. A job may consist of one or more operations. When scheduling jobs, the management generally does not focus solely on one objective. Roy (1985) pointed out that taking several criteria into account enables us to provide the decision maker with a more realistic solution. This study focuses on solving the multi-objective flexible job shop scheduling problem (MO-FJSSP) with three minimization objectives – total tardiness, total machine wo

Styles APA, Harvard, Vancouver, ISO, etc.

19

ZHAN, YAN-SHENG, and 詹晏昇. "Hybrid Genetic Algorithm Designed for Batched Flexible Job-Shop Scheduling." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/rh6d6h.

Texte intégral

Résumé :

碩士<br>國立高雄科技大學<br>電腦與通訊工程系<br>107<br>In the traditional foundry industry, the scheduling of operations is often determined by the veteran management staff or operators, but the effectiveness of such decisions is often narrow and limited. The decisions based on the past can not take into account the overall picture, artificial scheduling will consume a lot of human resource and difficult to deal with unexpected situations, which will make the production line blocked, so that the load can not be digested and the benefits will no longer exist. Therefore, it is necessary to design a scheduling mod

Styles APA, Harvard, Vancouver, ISO, etc.

20

Singh, Manas Ranjan. "A study on flexible flow shop and job shop scheduling using meta-heuristic approaches." Thesis, 2014. http://ethesis.nitrkl.ac.in/6625/1/PhD_510me805.pdf.

Texte intégral

Résumé :

Scheduling aims at allocation of resources to perform a group of tasks over a period of time in such a manner that some performance goals such as flow time, tardiness, lateness, and makespan can be minimized. Today, manufacturers face the challenges in terms of shorter product life cycles, customized products and changing demand pattern of customers. Due to intense competition in the market place, effective scheduling has now become an important issue for the growth and survival of manufacturing firms. To sustain in the current competitive environment, it is essential for the manufacturing fir

Styles APA, Harvard, Vancouver, ISO, etc.

21

Buddala, Raviteja. "A meta-heuristic approach for solving flexible flow-shop and job-shop scheduling problems." Thesis, 2019. http://ethesis.nitrkl.ac.in/10007/1/2019_PhD_RBuddala_514ME1006_A_meta-heuristic.pdf.

Texte intégral

Résumé :

The present day manufacturing industries face the external challenges like changes in market demand, customized products, shorter product life cycle and competition in the market. The manufacturing industries also face internal challenges like job fluctuations (job cancellations and sudden job arrivals) and internal uncertainties (uncertainties in processing time, tool failure, machine breakdown). To tackle these challenges in manufacturing industries, especially in shop floors, operations research community focused in last few decades on finding optimal schedules to allocate various jobs to d

Styles APA, Harvard, Vancouver, ISO, etc.

22

Huang-Wen, Chang, and 張皇文. "Flexible Job Shop Scheduling for the Array Process of LCD Manufacturing." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/89905171159051362137.

Texte intégral

Résumé :

碩士<br>國立清華大學<br>工業工程與工程管理學系<br>94<br>The TFT-array process is a portion of the TFT-LCD manufacturing. The scheduling problem of the TFT-array process can be treated as flexible job shop with recirculation. A flexible job shop is a generalization of the job shop. Each workstation consists of multiple parallel machines and the machines have similar functions. The machines in a workstation may have different efficiency. A job has to choose a qualified machine when entering a workstation. In addition, a job may visit some workstations more than once. To solve this difficult problem, this thesis us

Styles APA, Harvard, Vancouver, ISO, etc.

23

"Extensions of the dual-resource constrained flexible job-shop scheduling problem." Master's thesis, 2019. http://hdl.handle.net/2286/R.I.53922.

Texte intégral

Résumé :

abstract: The shift in focus of manufacturing systems to high-mix and low-volume production poses a challenge to both efficient scheduling of manufacturing operations and effective assessment of production capacity. This thesis considers the problem of scheduling a set of jobs that require machine and worker resources to complete their manufacturing operations. Although planners in manufacturing contexts typically focus solely on machines, schedules that only consider machining requirements may be problematic during implementation because machines need skilled workers and cannot run unsupervis

Styles APA, Harvard, Vancouver, ISO, etc.

24

Hsu, Shih-Hsien, and 徐世賢. "Scheduling of Distributed and Flexible Job-shop with a Terminal Series Machine." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/58apac.

Texte intégral

Résumé :

碩士<br>國立交通大學<br>工業工程與管理系所<br>104<br>This research investigates a scheduling problem in a manufacturing system which is a distributed and flexible job-shop (DFJS) with a terminal series workstation. The scheduling objective is to minimize total tardiness. In the context, each job has to go through the DFJS system and finally proceed to the series workstation. The scheduling problems are solved in two stages. First, we use a genetic algorithm (GA) to solve the DFJS scheduling problem. Then, based on the obtained DFJS scheduling results, we develop a scheduling algorithm for the terminal series w

Styles APA, Harvard, Vancouver, ISO, etc.

25

Ke, Huang Bin, and 柯煌彬. "Bottleneck-oriented beam search method for solving flexible job shop scheduling problem." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/69380869835708858414.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

26

陳弘奇. "A Genetic Algorithm with Enhanced Mutation forMultiobjective Flexible Job Shop Scheduling Problems." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/66335171532019062922.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

27

Hsu, Zhi-Peng, and 許志鵬. "Applications of Improved Hybrid Genetic Algorithm to Flexible Job-shop Scheduling Problem." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/09460332077093141036.

Texte intégral

Résumé :

碩士<br>國立高雄第一科技大學<br>機械與自動化工程研究所<br>101<br>In recent years, the concept of customer-first service release rapidly, the factory trying to enhance competitiveness and reduce production costs to create advantages and the optimization of production scheduling system for each production plant is an urgent issue need to be resolved. With the change in consumer habits, fast and immediate service has become a major target. This thesis presents a case improved global selection of Hybrid Genetic Algorithms (HGA) to solve the Flexible Job-shop Scheduling Problem (FJSP), the initialization can produce high

Styles APA, Harvard, Vancouver, ISO, etc.

28

You-LinLi and 李侑霖. "Hybriding genetic algorithm and data mining methods for flexible job shop scheduling." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/62401886563421350643.

Texte intégral

Résumé :

碩士<br>國立成功大學<br>工業與資訊管理學系專班<br>98<br>CF is a high custom-made product. It’s a routine work to change scheduling plan frequently to fit every customer’s delivery time especially in a tendency towards JIT management in the TFT-LCD manufacturing. It becomes a challenge to plan an efficient scheduling rapidly in flexible job shop. To solve this difficult problem, this study proposed one method that is called “Hybriding genetic algorithm and data mining methods”. This method contains there main steps. First, we create many order cases and deal with them by genetic algorithm method. Second, we use k

Styles APA, Harvard, Vancouver, ISO, etc.

29

吳持尊. "Scheduling of Distributed and Flexible Job-shop with a Terminal Batch Workstation." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/er7kfb.

Texte intégral

Résumé :

碩士<br>國立交通大學<br>工業工程與管理系所<br>106<br>This research investigates a scheduling problem in a manufacturing system which is a distributed and flexible job-shop (DFJS) with a terminal batch workstation problem. The scheduling objective is to minimize total tardiness. In the context, each job has to go through the DFJS system and finally proceed to the batch workstation. A batch machine can process multiple jobs simultaneously; arrival jobs even facing an available batch machine may need to wait for forming an effective batch for scheduling. Batching decision is therefore very important. The scheduli

Styles APA, Harvard, Vancouver, ISO, etc.

30

Ciou, Shi-Yuan, and 邱士源. "Production Scheduling with Setup Time and Deteriorating Jobs on Flexible Job-Shop." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/rjuwd3.

Texte intégral

Résumé :

碩士<br>國立雲林科技大學<br>工業工程與管理系<br>107<br>As the consumption pattern changes, manufacturers need to have the flexible production and rapid response ability to meet the changing needs of consumers. In order to cope with product diversity and different processes, manufacturers must add multiple non-related parallel machines to improve production capacity and the flexibility of machine scheduling, called “flexible job-shop” production system. However, in a real production system, it is common to find that setup time often has a dependency on the arranged operations sequence, and also that some workpie

Styles APA, Harvard, Vancouver, ISO, etc.

31

Kuo-Tsun, Cheng. "Integrating Particle Swarm Optimization and Simulated Annealing for Flexible Job Shop Scheduling Problems." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0006-2207200509181300.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Su, Hai-Hsing, and 蘇海興. "Using Threshold Accepting Algorithms to Solve Multi-Objective Flexible Job Shop Scheduling Problems." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/59757045318360848244.

Texte intégral

Résumé :

碩士<br>元智大學<br>工業工程與管理學系<br>99<br>Nowadays, in the highly competitive marketplace, product orders of low volume and high variety types have been increasing in demand. Flexible Job shop scheduling (FJSS) is one of the most popular manufacturing optimization models that fit this market trend. From a practical perspective of the manufacturing industry, management goals in production scheduling are often multi-faceted. In this research, we consider the following criteria: (1) production makespan; (2) total tardiness; (3) total machine workload; (4) critical machine workload. The first criterion, wh

Styles APA, Harvard, Vancouver, ISO, etc.

33

Wu, Tung-Ying, and 吳東穎. "Multi-Objective Flexible Job Shop Scheduling Problem Based on Monte-Carlo Tree Search." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/29982195339271468796.

Texte intégral

Résumé :

碩士<br>國立交通大學<br>資訊科學與工程研究所<br>102<br>Flexible job-shop scheduling problem (FJSP) is very important in both fields of production management and combinatorial optimization. This thesis addresses the multi-objective flexible job shop scheduling problem (MO-FJSP) with three objectives which minimizing makespan, maximal workload and total workload respectively. We consider these objectives with Pareto manner. Monte-Carlo Tree Search (MCTS) is successful in computer Go and many other games. In this paper, we propose an MCTS algorithm for FJSP. Our algorithm also incorporates Variable Neighborhood De

Styles APA, Harvard, Vancouver, ISO, etc.

34

Wei-Che, Cheng, and 程偉哲. "Flexible job shop scheduling with due windows - A two -pheromone ant colony approach." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/27865864719598386821.

Texte intégral

Résumé :

碩士<br>輔仁大學<br>管理學研究所<br>98<br>A good scheduling not only may improve machinery equipment's utilization ratio, and can assign the limited resources properly, raises the production efficiency, then reduces the cost. Job shop production system is one of basic production types, its scheduling of complexity is quite high. In faces the competition, the balance of workstation's load, using mixed type production system disposition is necessary for reducing the cost and using capacity effective. But in the flexible job shop type production system, in the workstation disposes parallel machine is the mos

Styles APA, Harvard, Vancouver, ISO, etc.

35

Cheng, Kuo-Tsun, and 鄭國村. "Integrating Particle Swarm Optimization and Simulated Annealing for Flexible Job Shop Scheduling Problems." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/v4de7z.

Texte intégral

Résumé :

碩士<br>國立臺北科技大學<br>工業工程與管理系所<br>94<br>Scheduling problems is the most difficult and important problems in the production management. Most scheduling problems are complex combinatorial optimization problems and hard to solve. The job-shop scheduling problem (JSP) is a branch of production scheduling, which is among the hardest combinatorial optimization problems. It is well known that this problem is NP-hard. Therefore, some heuristic methods such as genetic algorithm (GA), simulated annealing (SA) and ant colony optimization (ACO), were created to solve this problems. With more competitive envi

Styles APA, Harvard, Vancouver, ISO, etc.

36

Wang, Chang-Ruei, and 王昌銳. "A Two Phase Ant Colony Optimization Method for Flexible Job Shop Scheduling Problems." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/467q3s.

Texte intégral

Résumé :

碩士<br>國立臺北科技大學<br>工業工程與管理研究所<br>95<br>Traditional job-shop scheduling problem (JSP) has been investigated more than half centuries. In the literature, many researchers used different approaches to obtain good solution for solving JSP, especially in heuristic algorithm. The heuristic algorithm usually can find approximation optimal solution in the limited computation time. Common heuristic algorithm to solve combinatorial optimization problems is genetic algorithm, tabu search approach, ant colony optimization, simulated annealing and particle swarm optimization and so on. By more and more

Styles APA, Harvard, Vancouver, ISO, etc.

37

Lu, Po-Hsiang, and 盧柏翔. "Genetic Algorithms Embedded with Concise Chromosome Representations for Distributed and Flexible Job-shop Scheduling." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/82tfy6.

Texte intégral

Résumé :

博士<br>國立交通大學<br>工業工程與管理系所<br>103<br>This paper proposes four genetic algorithms (GA_JSA, GA_JS, GA_J, and GA_JCS) for solving distributed and flexible job-shop scheduling (DFJS) problems. A DFJS problem involves three scheduling decisions: (1) job-to-cell assignment, (2) operation-sequencing, and (3) operation-to-machine assignment. Therefore, solving a DFJS problem is essentially a 3-dimensional solution space search problem; each dimension represents a type of decision. The GA_JS algorithm is developed by proposing a new and concise chromosome representation SJOB, which models a 3-dimensiona

Styles APA, Harvard, Vancouver, ISO, etc.

38

Tsai, Yu-Ling, and 蔡侑陵. "A Genetic Algorithm for Meeting Due-Date in Distributed and Flexible Job-shop Scheduling." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/25kj24.

Texte intégral

Résumé :

碩士<br>國立交通大學<br>工業工程與管理系所<br>104<br>This research studies a distributed and flexible job shop (DFJS) scheduling problem which involves three scheduling decisions: (1) job-to-cell assignment, (2) operation-to-machine assignment, and (3) operation-sequencing. The complexity of solving DFJS problems is NP-hard. This research solves the DFJS scheduling problem for meeting due date, and the scheduling objective is to minimize total tardiness. This study proposes three genetic algorithms (called GA_OP_D, GA_JS_D, and IGA_D) which are adapted from prior studies to solve the DFJS problems. The three a

Styles APA, Harvard, Vancouver, ISO, etc.

39

Leu, Chun-Liang, and 呂俊良. "Optimization Algorithms Design for Support Vector Machine Classifier and Flexible Job-shop Scheduling Problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/93096301380273676546.

Texte intégral

Résumé :

博士<br>淡江大學<br>電機工程學系博士班<br>97<br>In this dissertation, two types of single-objective hybrid model are proposed to improve the classification rate for Support Vector Machine (SVM) classifier and two effective multi-objective optimization algorithms are developed to solve Flexible Job-shop Scheduling Problems (FJSP). In the optimization design for SVM classifier, an order-independent algorithm for the data reduction, called the Dynamic Condensed Nearest Neighbor (DCNN) rule, is proposed to adaptively construct prototypes in training dataset and to reduce the redundant or noisy instances in a cla

Styles APA, Harvard, Vancouver, ISO, etc.

40

Tsai, Hung-Te, and 蔡宏德. "Applications of Genetic Algorithm to Optimize Unrelated Parallel Machines of Flexible Job-shop Scheduling Problem." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/70431194889748468369.

Texte intégral

Résumé :

碩士<br>國立高雄第一科技大學<br>機械與自動化工程研究所<br>101<br>In the face of a competitive manufacturing environment to reduce production costs, and effective use of production capacity and balance of factory load, hybrid production system configuration must be used. Unrelated parallel machines of flexible job shop is a hybrid production system. Therefore, this research will focus on Unrelated parallel machines of flexible job shop scheduling problem, proposed uses two different types of chromosome encoding, decimal coding and Integer coding combine with genetic algorithm, targeted at minimizing completion time f

Styles APA, Harvard, Vancouver, ISO, etc.

41

Lai, Juan-Ming, and 賴阮明. "Integrating Particle Swarm Optimization and Honey-bee Mating Optimization for Flexible Job Shop Scheduling Problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/qhgr3b.

Texte intégral

Résumé :

碩士<br>國立臺北科技大學<br>工業工程與管理研究所<br>97<br>Most scheduling problems are very complex combinatorial optimization problems and hard to solve. The job-shop scheduling problem (JSP) is one of the problems. In the literature, more and more researchers used different heuristic algorithms to solve combinatorial optimization problems. Common algorithms are simulated annealing, genetic algorithm, tabu search approach, ant colony optimization and particle swarm optimization and so on. By more and more progress technology, the traditional job-shop scheduling is not enough to solve the diversity and a little a

Styles APA, Harvard, Vancouver, ISO, etc.

42

Wu, Meng-Zhe, and 吳孟哲. "Applications of Improved Genetic Algorithm to the Multi-Manufacturing Plant and Flexible Job-shop Scheduling Problem." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/16054232605849067889.

Texte intégral

Résumé :

碩士<br>國立高雄第一科技大學<br>機械與自動化工程研究所<br>101<br>This research proposes a method of improved genetic algorithm to solve the multi- manufacturing plant and flexible job-shop scheduling problem. Multi-factory production scheduling problem considering four parts: the first part is “allocate job to factories "; the second part "the routing of operations "; the third part " the assignment of operations to machines in Plant"; fourth part is " delivery time of the logistics center between the factory.” The problem for production scheduling objective is total completion time (makespan), it refers to all jobs

Styles APA, Harvard, Vancouver, ISO, etc.

43

Lai, Po-han, and 賴柏翰. "Application of Multi-objective Genetic Algorithms for Flexible Job-Shop Scheduling Problem Using Manufacturing as an Example." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/82947141008349300731.

Texte intégral

Résumé :

碩士<br>國立高雄第一科技大學<br>系統資訊與控制研究所<br>101<br>With increasing development of technology and cloud computing, it can reduce the product life cycle dramatically, rise the product cost, and drop in profits sharply. In addition, manual schedule need more time and poor ability to respond when order need to change. These factors can cause people hardly to predict capacity of production line. How to improve product quality, reduce cost of production, enhance competitiveness and conform delivery time through optimal control schedule? In other to satisfy demand order and reduce the cost, people have to cons

Styles APA, Harvard, Vancouver, ISO, etc.

44

Soares, Sophia de Queiroz. "Escalonamento da produção num sistema job-shop flexível: aplicação ao fabrico de pavimentos de madeira." Master's thesis, 2021. http://hdl.handle.net/10316/95536.

Texte intégral

Résumé :

Dissertação de Mestrado em Engenharia e Gestão Industrial apresentada à Faculdade de Ciências e Tecnologia<br>This work is based on a curricular internship at the startup SimpleAxis, in Portugal, as part of the Masters in Industrial and Management Engineering at the University of Coimbra. Its main objective is to propose a solution related to the production scheduling of Castro Wood Floors enterprise, in order to minimize the makespan and the tardiness in deliveries in order to optimize the production process creating new opportunities of development to the company.In this sense, initially, a

Styles APA, Harvard, Vancouver, ISO, etc.

45

Hernandez, David Alejandro Villalobos, and David Alejandro Villalobos Hernandez. "Application of a Genetic Algorithm for the Flexible Job Shop Scheduling Problem of the Printing Operation in the Apparel Industry." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/q23tuz.

Texte intégral

Résumé :

碩士<br>元智大學<br>工業工程與管理學系<br>104<br>Production Scheduling requires the integration of multiple parameters. Finding the best possible combination of these parameters can become a very challenging task. This study examines the Job Shop Scheduling Problem that occurs on the apparel industry (specifically in the garment embellishment process), of a real factory located in El Salvador. A feasible solution for the makespan minimization is achieved with the use of a genetic algorithm (GA). Methodology section includes problem statement, a detailed description of the production process and its constrain

Styles APA, Harvard, Vancouver, ISO, etc.

46

FANG, JIN-YI, and 方進義. "The design of using virtual cells concept to solve the STPP and scheduling problems in flexible job shop manufacturing systems." Thesis, 1991. http://ndltd.ncl.edu.tw/handle/81619790334306143611.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

47

"Minimizing Total Weighted Tardiness in a Two Staged Flexible Flow-shop with Batch Processing, Incompatible Job Families and Unequal Ready Times Using Time Window Decomposition." Master's thesis, 2012. http://hdl.handle.net/2286/R.I.15135.

Texte intégral

Résumé :

abstract: This research is motivated by a deterministic scheduling problem that is fairly common in manufacturing environments, where there are certain processes that call for a machine working on multiple jobs at the same time. An example of such an environment is wafer fabrication in the semiconductor industry where some stages can be modeled as batch processes. There has been significant work done in the past in the field of a single stage of parallel machines which process jobs in batches. The primary motivation behind this research is to extend the research done in this area to a two-stag

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!