Log in

Relevant bibliographies by topics / Dynamic flexible job shop / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Dynamic flexible job shop.

Dissertations / Theses on the topic 'Dynamic flexible job shop'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Dynamic flexible job shop.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

3

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

4

Vilcot, Geoffrey. "Algorithmes approchés pour des problèmes d'ordonnancement multicritères de type job shop flexible et job shop multiressource." Phd thesis, Université François Rabelais - Tours, 2007. http://tel.archives-ouvertes.fr/tel-00198068.

Full text

Abstract:

Ce travail de thèse s'inscrit dans le cadre d'une collaboration industrielle avec la société Volume Software pour le développement du module d'ordonnancement du logiciel "DirectPlanning". Dans ce travail, nous étudions le problème de job shop flexible multicritère et le problème de job shop multiressource multicritère. Notre objectif est de déterminer une approximation du front de Pareto. Nous avons proposé des algorithmes de résolution approchés et plus particulièrement des algorithmes de recherche Tabou et des algorithmes génétiques. Nous avons proposé différentes versions de nos méthodes po

APA, Harvard, Vancouver, ISO, and other styles

5

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

7

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

8

Tejada, Muñoz Guillermo. "Enrutamiento y secuenciación óptimos en un flexible Job Shop multiobjetivo mediante algoritmos genéticos." Doctoral thesis, Universidad Nacional Mayor de San Marcos, 2017. https://hdl.handle.net/20.500.12672/6657.

Full text

Abstract:

Propone una solución óptima al problema de programar (Scheduling) el procesamiento de un conjunto de Jobs (Tareas) en un conjunto de máquinas de una manufactura tipo Flexible Job Shop (FJS-Taller Flexible). La solución minimiza tres criterios: El Maximum Workload (WM), el Total Workload (WT) y el Makespan (CM), es decir, el problema es de Optimización Multiobjetivo. El problema FJS es actualmente estudiado por muchos investigadores porque corresponde a uno de optimización combinatoria muy difícil de resolver (NP-Hard) y porque una solución óptima redunda en una producción eficiente de la manuf

APA, Harvard, Vancouver, ISO, and other styles

9

Wein, Lawrence M., and Jihong Ou. "The Impact of Processing Time Knowledge on Dynamic Job-Shop Scheduling." Massachusetts Institute of Technology, Operations Research Center, 1989. http://hdl.handle.net/1721.1/5388.

Full text

Abstract:

The goal of this paper is to determine if the results for dynamic job-shop scheduling problems are affected by the assumptions made with regard to the processing time distributions and the scheduler's knowledge of the processing times. Three dynamic jobshop scheduling problems (including a two station version of Conway et al.'s [2] nine station symmetric shop) are tested under seven different scenarios, one deterministic and six stochastic, using computer simulation. The deterministic scenario, where the processing times are exponential and observed by the scheduler, has been considered in man

APA, Harvard, Vancouver, ISO, and other styles

10

Previero, Wellington Donizeti. "Estratégias de resolução para o problema de job-shop flexível." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-20102016-123243/.

Full text

Abstract:

Nesta tese apresentamos duas estratégias para resolver o problema de job-shop flexível com o objetivo de minimizar o makespan. A primeira estratégia utiliza um algoritmo branch and cut (B&C) e a segunda abordagens matheuristics. O algoritmo B&C utiliza novas classes de inequações válidas, originalmente formulada para o problema de job-shop e estendida para o problema em questão. Para que as inequações válidas sejam eficientes, o modelo proposto por Birgin et al, (2014) (A milp model for an extended version of the fexible job shop problem. Optimization Letters, Springer, v. 8, n. 4, 1417-1431),

APA, Harvard, Vancouver, ISO, and other styles

11

Boukef, Hela. "Sur l’ordonnancement d’ateliers job-shop flexibles et flow-shop en industries pharmaceutiques : optimisation par algorithmes génétiques et essaims particulaires." Thesis, Ecole centrale de Lille, 2009. http://www.theses.fr/2009ECLI0007/document.

Full text

Abstract:

Pour la résolution de problèmes d’ordonnancement d’ateliers de type flow-shop en industries pharmaceutiques et d’ateliers de type job-shop flexible, deux méthodes d’optimisation ont été développées : une méthode utilisant les algorithmes génétiques dotés d’un nouveau codage proposé et une méthode d’optimisation par essaim particulaire modifiée pour être exploitée dans le cas discret. Les critères retenus dans le cas de lignes de conditionnement considérées sont la minimisation des coûts de production ainsi que des coûts de non utilisation des machines pour les problèmes multi-objectifs relatif

APA, Harvard, Vancouver, ISO, and other styles

12

Ben, Hmida Abir. "Méthodes arborescentes pour la résolution de problèmes d'ordonnancement flexible." Toulouse, INSA, 2009. http://eprint.insa-toulouse.fr/archive/00000318/.

Full text

Abstract:

Au cours de ces dernières années, les problèmes d’ordonnancement flexible ont largement attiré l’attention des chercheurs dans le domaine de la recherche opérationnelle. Ces problèmes présentent une difficulté supplémentaire du fait qu’une opération peut être exécutée par une ou plusieurs ressources devant être choisie(s) parmi d’autres candidates. L’objectif étant alors d’affecter et de séquencer les opérations sur les ressources en minimisant la durée d’exécution totale ou makespan. Dans cette étude, nous proposons de résoudre trois types de problèmes d’ordonnancement flexible : le flow shop

APA, Harvard, Vancouver, ISO, and other styles

13

Bommakanti, Anil. "Design and implementation of a web based shop floor control system to maintain schedule feasibility in a dynamic job shop environment." FIU Digital Commons, 1999. http://digitalcommons.fiu.edu/etd/1718.

Full text

Abstract:

The effective control of production activities in dynamic job shop with predetermined resource allocation for all the jobs entering the system is a unique manufacturing environment, which exists in the manufacturing industry. In this thesis a framework for an Internet based real time shop floor control system for such a dynamic job shop environment is introduced. The system aims to maintain the schedule feasibility of all the jobs entering the manufacturing system under any circumstance. The system is capable of deciding how often the manufacturing activities should be monitored to check for c

APA, Harvard, Vancouver, ISO, and other styles

14

Boukef, Hela. "Sur l'ordonnancement d'ateliers job-shop flexibles et flow-shop en industries pharmaceutiques : optimisation par algorithmes génétiques et essaims particulaires." Phd thesis, Ecole Centrale de Lille, 2009. http://tel.archives-ouvertes.fr/tel-00577101.

Full text

Abstract:

Pour la résolution de problèmes d'ordonnancement d'ateliers de type flow-shop en industries pharmaceutiques et d'ateliers de type job-shop flexible, deux méthodes d'optimisation ont été développées : une méthode utilisant les algorithmes génétiques dotés d'un nouveau codage proposé et une méthode d'optimisation par essaim particulaire modifiée pour être exploitée dans le cas discret. Les critères retenus dans le cas de lignes de conditionnement considérées sont la minimisation des coûts de production ainsi que des coûts de non utilisation des machines pour les problèmes multi-objectifs relatif

APA, Harvard, Vancouver, ISO, and other styles

15

Ghoniem, Ahmed. "Static and dynamic job-shop scheduling using rolling-horizon approaches and the Shifting Bottleneck Procedure." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/31485.

Full text

Abstract:

Over the last decade, the semiconductor industry has witnessed a steady increase in its complexity based on improvements in manufacturing processes and equipment. Progress in the technology used is no longer the key to success, however. In fact, the semiconductor technology has reached such a high level of complexity that improvements appear at a slow pace. Moreover, the diffusion of technology among competitors shows that traditional approaches based on technological advances and innovations are not sufficient to remain competitive. A recent crisis in the semiconductor field in the summer 2

APA, Harvard, Vancouver, ISO, and other styles

16

Benhmida, Abir. "Méthodes arborescentes pour la résolution de problèmes d'ordonnancement flexible." Phd thesis, INSA de Toulouse, 2009. http://tel.archives-ouvertes.fr/tel-00462548.

Full text

Abstract:

Au cours de ces dernières années, les problèmes d'ordonnancement flexible ont largement attiré l'attention des chercheurs dans le domaine de la recherche opérationnelle. Ces problèmes présentent une difficulté supplémentaire du fait qu'une opération peut être exécutée par une ou plusieurs ressources devant être choisie(s) parmi d'autres candidates. L'objectif étant alors d'affecter et de séquencer les opérations sur les ressources en minimisant la durée d'exécution totale ou makespan. Dans cette étude, nous proposons de résoudre trois types de problèmes d'ordonnancement flexible : le flow shop

APA, Harvard, Vancouver, ISO, and other styles

17

Moratori, Patrick. "Match-up strategies and fuzzy robust scheduling for a complex dynamic real world job shop scheduling problem." Thesis, University of Nottingham, 2013. http://eprints.nottingham.ac.uk/13054/.

Full text

Abstract:

This thesis investigate a complex real world job shop scheduling / rescheduling problem, in which the presence of uncertainties and the occurrence of disruptions are tackled to produce efficient and reliable solutions. New orders arrive every day in the shop floor and they have to be integrated in the existent schedule. Match-up algorithms are introduced to collect the idle time on machines and accommodate these newly arriving orders. Their aim is to obtain new schedules with good performance which are at the same time highly stable, meaning that they resemble as closely as possible the initia

APA, Harvard, Vancouver, ISO, and other styles

18

Dik, Guvenc. "A mathematical approach to synchronise and optimise emergency department operations." Thesis, Queensland University of Technology, 2019. https://eprints.qut.edu.au/130764/1/Guvenc_Dik_Thesis.pdf.

Full text

Abstract:

This study develops a mathematical optimisation approach to tackle the patient flow problem. This problem arises from emergency department operations and its interactions with ambulance and hospital services. A predictive scheduling model is developed based on the flexible job shop scheduling framework. The developed approach can be embedded in real-time intelligent decision support systems. These systems can provide hospitals with quantitatively identified clinical resources causing transitional bottlenecks and risk evaluation whilst conforming to performance targets. Moreover, it can provide

APA, Harvard, Vancouver, ISO, and other styles

19

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

Full text

Abstract:

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, è

APA, Harvard, Vancouver, ISO, and other styles

20

Alatas, Boran. "Development Of A Web-based Dynamic Scheduling Methodology For A Flexible Manufacturing Cell Using Agent Based Distributed Internet Applications." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12604693/index.pdf.

Full text

Abstract:

The increasing importance of computer leads to develop new manufacturing methods. One of the most important example<br>&ldquo<br>unmanned shop floor&rdquo<br>model aims, the mankind can work in jobs that they can be more efficient and more comfortable. As the base of this model, in Middle East Technical University Computer Integrated Manufacturing Laboratory (METUCIM) &ldquo<br>Agent Version 1.1&rdquo<br>system is developed. Windows Distributed Internet Applications (DNA) modeling technique is used for the software development. In the developed system, by using web pages, one can give work ord

APA, Harvard, Vancouver, ISO, and other styles

21

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.

Full text

Abstract:

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çã

APA, Harvard, Vancouver, ISO, and other styles

22

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/.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

23

Maranhão, Filho Éfrem de Aguiar. "Alocação e movimentação dinâmica de contêineres : um modelo integrado de escalonamento." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2009. http://hdl.handle.net/10183/17544.

Full text

Abstract:

A logística de contêiner vem aumentando sua participação em volume de cargas transportadas, tornando-se a parcela mais significativa do tráfego de mercadorias. Com isso, o gerenciamento dos altos custos envolvidos com a aquisição, manutenção, manipulação e transporte desses contêineres tornam-se um problema relevante para as organizações. As alocações dos contêineres cheios e vazios são comumente vistos como dois sistemas distintos e estáticos e não de forma intregada e dinâmica. Há um número restrito de trabalhos na literatura desenvolvendo heurísticas integrando os sistemas, porém não foi en

APA, Harvard, Vancouver, ISO, and other styles

24

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

25

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

26

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/.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

27

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

28

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/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Silva, Leandro Mengue da. "Um modelo de otimização baseado em algoritmo memético para o escalonamento de ordens de produção utilizando divisão de lotes de tamanho variável." Universidade do Vale do Rio dos Sinos, 2017. http://www.repositorio.jesuita.org.br/handle/UNISINOS/6353.

Full text

Abstract:

Submitted by JOSIANE SANTOS DE OLIVEIRA (josianeso) on 2017-06-16T12:13:46Z No. of bitstreams: 2 Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5) Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5)<br>Made available in DSpace on 2017-06-16T12:13:47Z (GMT). No. of bitstreams: 2 Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5) Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5) Previous issue date: 2017-03-23<br>CNPQ

APA, Harvard, Vancouver, ISO, and other styles

30

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

31

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Cheng, Tzu-Wei, and 鄭子瑋. "Improved Simplified Swarm Optimization for Flexible Job Shop Problem." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/p2v5pd.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

34

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

35

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

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

Full text

Abstract:

碩士<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

APA, Harvard, Vancouver, ISO, and other styles

37

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

Full text

Abstract:

碩士<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

APA, Harvard, Vancouver, ISO, and other styles

38

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

Full text

Abstract:

碩士<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

APA, Harvard, Vancouver, ISO, and other styles

39

Huang, Hsuan-Yung, and 黃炫詠. "Analysis of Job Shop Dispatching with Flexible Pooling and Upstream Information." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/06180112886812455122.

Full text

Abstract:

碩士<br>國立高雄第一科技大學<br>運籌管理研究所<br>103<br>As market demands moving toward small-volume and large-variety, production setup has become a critical issue that affects system performance. Using flexible pooling could make capacity control more effective. This paper develops Arena simulation programs to analyze job shop production systems with flexible pooling and upstream/downstream information. We first consider a basic job shop system with three different demand patterns, totally balance, totally unbalance, and seasonal variation. Three pooling rules are tested, full pooling, partial pooling, and f

APA, Harvard, Vancouver, ISO, and other styles

40

Berg, L. Gene. "Simulation based analysis of flexible manufacturing cells in job-shop environments." 1985. http://catalog.hathitrust.org/api/volumes/oclc/12755421.html.

Full text

Abstract:

Thesis (M.S.)--University of Wisconsin--Madison, 1985.<br>Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 93-97).

APA, Harvard, Vancouver, ISO, and other styles

41

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

42

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.

Full text

Abstract:

碩士<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

APA, Harvard, Vancouver, ISO, and other styles

43

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

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.

Full text

Abstract:

碩士<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

APA, Harvard, Vancouver, ISO, and other styles

46

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

Full text

Abstract:

碩士<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

APA, Harvard, Vancouver, ISO, and other styles

47

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

Full text

Abstract:

碩士<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

APA, Harvard, Vancouver, ISO, and other styles

48

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.

Full text

Abstract:

碩士<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

APA, Harvard, Vancouver, ISO, and other styles

49

Kao, Hsin-ting, and 高心婷. "Simulation Studies of Dispatching Rules in a Dynamic Job Shop." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/s37v3e.

Full text

Abstract:

碩士<br>朝陽科技大學<br>工業工程與管理系碩士班<br>94<br>Since the socio-economic level and purchase behavior changes, customers want products that have uniqueness as well as multiple-functionality. Therefore, many manufacturers adopt multiple-type and small-quantity production systems such as job shops. Over the pass few decades, many studies have been conducted on the performance of dispatching rules in job shop environment. However, most of them do not address the issue of dynamic events, while the remaining only focuses on general performance measurements. It is inevitable that the real-world production s

APA, Harvard, Vancouver, ISO, and other styles

50

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!