Relevant bibliographies by topics / Flowshop Scheduling / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Flowshop Scheduling.

Dissertations / Theses on the topic 'Flowshop Scheduling'

Author: Grafiati
Published: 4 June 2021
Last updated: 15 February 2022

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 'Flowshop Scheduling.'

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

Park, Malcolm McKenzie. "Flowshop sequencing : a graphical approach /." Connect to thesis, 1990. http://eprints.unimelb.edu.au/archive/00001755.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Moursli, Omar. "Scheduling the hybrid flowshop : branch and bounnd algorithms." Université catholique de Louvain, 1999. http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-11262003-101952/.

Full text
Abstract:
This thesis studies Production Scheduling in a multistage hybrid flowshop facility. It first states the general Production Planning and Scheduling problem and highlights some drawbacks of classical solutions. A theoretical decomposition-based approach is introduced whose main issue is to overcome non-efficient capacity utilization. By using Branch and Bound methods, an in-depth analysis of the scheduling part of the system is then carried out throughout the study and development of upper and lower bounds as well as branching schemes. Already-existing and new heuristics are presented and compar
APA, Harvard, Vancouver, ISO, and other styles
3

Kaněra, Vojtěch. "Hybridní flowshop se seřízením." Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-5109.

Full text
Abstract:
This work should serve as a source of information on the issue of production scheduling. The work is particularly focused on the relatively new terms in optimization of processing of production batches area, such as flowshop and its modifications in the form of so-called hybrid flowshop. The work is divided into five chapters. The first chapter consists of an introduction. In the second chapter I mention the theory of scheduling, the third part deals with the history of flowshop and in the fourth part I check the functionality of new models on real data. In conclusion I summarize the contents
APA, Harvard, Vancouver, ISO, and other styles
4

Yamada, Takeshi. "Studies on Metaheuristics for Jobshop and Flowshop Scheduling Problems." 京都大学 (Kyoto University), 2003. http://hdl.handle.net/2433/148279.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Luo, Hao, and 罗浩. "Hybrid flowshop scheduling with job interdependences using evolutionary computing approaches." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B47849551.

Full text
Abstract:
This research deals with production scheduling of manufacturing systems that predominantly consist of hybrid flowshops. Hybrid Flowshop Scheduling (HFS) problems are common in metal working industries. Their solution has significant inferences on company performance in a globally competitive market in terms of production cycle time, delivery dates, warehouse and work-in-process inventory management. HFS problems have attracted considerable research efforts on examining their scientific complexity and practical solution algorithms. In conventional HFS systems, an individual job goes through th
APA, Harvard, Vancouver, ISO, and other styles
6

Ibrahem, Al-mehdi Mohamed M. "Scheduling optimization of cellular flowshop with sequence dependent setup times." Proceedings of the 47th CIRP Conference on Manufacturing Systems, 2014. http://hdl.handle.net/1993/30730.

Full text
Abstract:
In cellular manufacturing systems, minimization of the completion time has a great impact on the production time, material flow, and productivity. An effective scheduling is crucial to attaining the advantages of cellular manufacturing systems. This dissertation attempts to solve the Flowshop Manufacturing Cell (cellular flowshop) Scheduling Problem with Sequence Dependent Setup Times (FMCSP with SDSTs) considering two performance measures: the total flow time as a mono objective, and the makespan and total flow time combined as a bi-criteria scheduling problem. The proposed problem is kno
APA, Harvard, Vancouver, ISO, and other styles
7

Dai, Jianbin. "Batch scheduling of two-machine limited-buffer flowshop with setup and removal times." Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04062004-164623/unrestricted/dai%5Fjianbin%5F200312%5Fphd.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shieh, Alireza. "A simulated annealing approach for flexible flowshop scheduling to maximize flexibility." Morgantown, W. Va. : [West Virginia University Libraries], 2004. https://etd.wvu.edu/etd/controller.jsp?moduleName=documentdata&jsp%5FetdId=18.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 2004.<br>Title from document title page. Document formatted into pages; contains xii, 112 p. : ill. Includes abstract. Includes bibliographical references (p. 95-99).
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Weibo. "Scheduling algorithm development for permutation flowshop under static and dynamic environment." Thesis, Queen's University Belfast, 2017. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.727425.

Full text
Abstract:
Permutation flowshop scheduling problem (PFSP) is a classical combinatorial optimisation problem, which has attracted much attention from academia and industry in the last two decades. However, there are still great challenges to overcome. In existing heuristic methods, jobs with similar processing times cannot be efficiently distinguished, so that jobs are not effectively sequenced, which could result in a poor scheduling solution. Also, most existing research has focused on static PFSPs with a single-objective, however, a single objective is sometimes not good enough, and multiple objectives
APA, Harvard, Vancouver, ISO, and other styles
10

Luo, Hao. "Two-stage hyhrid flowshop scheduling in a metalworking company using genetic algorithm." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B41758109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Luo, Hao, and 羅浩. "Two-stage hyhrid flowshop scheduling in a metalworking company using genetic algorithm." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B41758109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Cheng, Wei. "Heuristics for two-machine flowshop scheduling with setup times and an availability constraint /." Electronic version (PDF), 2007. http://dl.uncw.edu/etd/2007-3/chengw/weicheng.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Almasarwah, Najat E. "Family Formation, Loading and Batch-Cyclic Flowshop Scheduling in Cellular Manufacturing Systems." Ohio University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1503605158270554.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Mainieri, Guilherme Barroso. "Heurísticas para a minimização do atraso total no ambiente flowshop com múltiplos processadores." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-13072009-172614/.

Full text
Abstract:
Neste trabalho será estudado um ambiente de produção que é freqüentemente encontrado na prática: o flowshop com múltiplos processadores. No caso estudado existem estágios em série e em cada estágio existe um número de máquinas idênticas em paralelo. Todas as tarefas devem ser processadas por todos os estágios. O objetivo é minimizar o atraso das tarefas. Primeiramente o problema foi abordado através de um método que programa as tarefas por estágio e em ordem direta, ou seja, do primeiro para o último estágio. Em seguida, foram desenvolvidas duas novas regras que utilizam o mesmo método de prog
APA, Harvard, Vancouver, ISO, and other styles
15

Palekar, Nipun Pushpasheel. "Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking." Thesis, Virginia Tech, 2000. http://hdl.handle.net/10919/34997.

Full text
Abstract:
A CONWIP (Constant Work-In-Progress) system is basically a hybrid system with a PUSH-PULL interface at the first machine in the line. This research addresses the most general case of a cyclic CONWIP system by incorporating two additional constraints over earlier studies namely; stochastic processing times and limited intermediate storage. One of the main issues in the design of a CONWIP system is the WIP level 'M', to be maintained. This research proposes an iterative procedure to determine this optimal level. The second main issue is the optimization of the line by determining an appropriate
APA, Harvard, Vancouver, ISO, and other styles
16

Filho, Marcio Antonio Ferreira Belo. "Programação de produção e dimensionamento de lotes para flowshop." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-17112010-101418/.

Full text
Abstract:
O problema integrado de programação de produção e dimensionamento de lotes em ambiente fowshop consiste em estabelecer tamanhos de lotes de produção e alocar máquinas para processá-los dentro de um horizonte de planejamento, em uma linha de produção com máquinas dispostas em série. O problema considera que a demanda deve ser atendida sem atrasos, que a capacidade das máquinas deve ser respeitada e que as preparações de máquinas são dependentes da sequência de produção e preservadas entre períodos do horizonte de planejamento. O objetivo é determinar uma programação de produção visando minimiz
APA, Harvard, Vancouver, ISO, and other styles
17

Gomes, Francisco Regis Abreu. "Algoritimo genÃtico aplicado aos problema de seqÃenciamento permutacional flowshop sem e com restriÃÃo de espera." Universidade Federal do CearÃ, 2008. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1220.

Full text
Abstract:
CoordenaÃÃo de AperfeiÃoamento de NÃvel Superior<br>Neste trabalho foram tratados dois problemas: o primeiro à denominado Continuous Permutation Flowshop Scheduling Problem (CPFSP), que possui a restriÃÃo de que nenhuma tarefa pode esperar por processamento entre mÃquinas consecutivas; o segundo à denominado de Permutation Flowshop Scheduling Problem (PFSP), em que a restriÃÃo anterior nÃo existe. A metaheurÃstica Algoritmo GenÃtico (AG) tem sido aplicada com sucesso ao PFSP, mas atà o momento nÃo foi encontrado na literatura algo que mostre que o AG à um bom mÃtodo para o CPFSP. O objetivo de
APA, Harvard, Vancouver, ISO, and other styles
18

Branco, Fábio José Ceron. "Avaliação de métodos heurísticos para o problema no-wait flowshop com o critério de minimização da duração total da programação." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/18/18140/tde-07122006-100703/.

Full text
Abstract:
Este trabalho apresenta o problema de programação de operações em máquinas no ambiente no-wait flowshop com o critério de minimização da duração total da programação. Aplicações para o problema no-wait flowshop podem ser encontrados em muitas indústrias, por exemplo, em indústrias de processamento de metais, químicos e farmacêuticos. Neste trabalho, são propostos e avaliados novos métodos heurísticos para o problema, e a superioridade do melhor método proposto é comprovada através uma extensa experimentação computacional.<br>This work deals with the no-wait flowshop scheduling problem with the
APA, Harvard, Vancouver, ISO, and other styles
19

Urlings, Thijs. "Heuristics and metaheuristics for heavily constrained hybrid flowshop problems." Doctoral thesis, Universitat Politècnica de València, 2010. http://hdl.handle.net/10251/8439.

Full text
Abstract:
Due to the current trends in business as the necessity to have a large catalogue of products, orders that increase in frequency but not in size, globalisation and a market that is increasingly competitive, the production sector faces an ever harder economical environment. All this raises the need for production scheduling with maximum efficiency and effectiveness. The first scientific publications on production scheduling appeared more than half a century ago. However, many authors have recognised a gap between the literature and the industrial problems. Most of the research concentrates on o
APA, Harvard, Vancouver, ISO, and other styles
20

Bellanger, Adrien. "Ordonnancement sur les machines à traitement par batches et contraintes de compatibilité." Phd thesis, Institut National Polytechnique de Lorraine - INPL, 2009. http://tel.archives-ouvertes.fr/tel-00606383.

Full text
Abstract:
Dans cette thèse, nous avons traité les problèmes d'ordonnancement d'ateliers de type flow- shop hybride à deux étages avec machines à traitement par batches sur le second étage et compatibilité entre les tâches. Les durées opératoires des tâches sont données par des intervalles, et les tâches sont dites compatibles si elles partagent une même durée d'exécution. Pour le problème de minimisation de la date de fin d'ordonnancement de ce type d'atelier, nous avons développé 6 heuristiques à performances garanties. D'après les expériences réalisées, ces heuristiques sont efficaces sur de grandes i
APA, Harvard, Vancouver, ISO, and other styles
21

Liou, Jiam-Jie, and 劉建杰. "MILP Models for Flowshop Scheduling Problems." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/4hq7yc.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理研究所<br>98<br>Permutation Flowshop Scheduling Problem (PFSP) is an important issue in manufacturing. To improve the system performance, the decision makers need to reduce process time and inventory level, enhance ratio of utilization, and delivery on time. The problem of an n-job, m-machine Flowshop Scheduling Problem is discussed. A mixed-integer linear program (MILP) is formulated with considerably reduced number of integer binary variables. Most of research in production scheduling is concerned with the minimization of a single criterion. However, scheduling problem
APA, Harvard, Vancouver, ISO, and other styles
22

ZHENG, JIA-WEN, and 鄭佳汶. "Mixed-blocking Permutation Flowshop Scheduling Problems." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/x69ved.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系<br>107<br>In the flowshop environment, different constraints between successive machines may cause various types of blocking. The mixed-blocking permutation flowshop is a flowshop with various types of blocking constraints at the same time. This study proposes a simulated annealing (SA) algorithm to minimize the total flow time for the mixed-blocking permutation flowshop scheduling problem (MBPFSP). To evaluate the efficiency of the proposed algorithm, we compared it with two iterated greedy (IG)-based algorithms and a state-of-the-art constraint guided local search
APA, Harvard, Vancouver, ISO, and other styles
23

朱馨吟. "No-wait Flowshop Scheduling with Parallel Machines." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/22767750508928650121.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程與管理系所<br>96<br>This study addresses a no-wait flowshop scheduling problem with parallel machines at the starting stage. We proposed two effective methods, called TS_T and TS_P, to determine the jobs sequence, which is a priority list of the processing order for the jobs in the final schedule. Several examples are designed to show that the proposed heuristics are accurate and outperform the existing methods used to solve a no-wait flowshop problem and a parallel machines scheduling problem. Furthermore, based on the scheduling results produced by the proposed heuristics, the
APA, Harvard, Vancouver, ISO, and other styles
24

Chen, Chun-Han, and 陳軍翰. "Flowshop manufacturing cell scheduling problems with rejection." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/8x466u.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系碩士班<br>100<br>The Flowshop manufacturing cell scheduling problem (FMCSP) with sequence-dependent family setup times (SDFSTs) has become a key area in the field of scheduling. We want to discuss the FMCSPs with rejection because the company capacity is limited in the real word. We can not satisfy every customer. Therefore, we need to know how to choose the right orders, because if we can not finish the product before the customer’s deadline, the product will lose its value. Moreover, the customers will lose their confidence toward us. In this study, a harmony search al
APA, Harvard, Vancouver, ISO, and other styles
25

Wu, Chien-Hua, and 吳建樺. "Distributed Flowshop Scheduling Problems with Blocking Constrain." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/qarnvg.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系碩士班<br>101<br>Among the ordinary flow shop, there are many temporary storage area, place the workpiece is waiting, but many of these do not exist in practice environments temporary area. Therefore derive blocking flowshop scheduling problem. Flowshop scheduling research has been focused, with the recent changes in the processing environment, from a single factory slowly transformed into the trend of many factories, therefore, this study assigned for the process factory to join the factors and blocking constrain. The optimization criterion is the minimization of the m
APA, Harvard, Vancouver, ISO, and other styles
26

Bai, Ching-Hsu, and 白景旭. "Distributed Multi-stage Flexible Flowshop Scheduling Problems." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/958nps.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系碩士班<br>101<br>In todays globalized environment, Producing products in different locations is a global trend, therefore the DFSP is increasing attention. In practice, MSHF problem is more impotant then before, The purpose of this study is to solve distributed multi-stage flexible flowshop scheduling problems with Iterated greedy heuristic.In view of the the strongly NP-hard nature of this problem, Iterated greedy heuristic has better experimental results then other heuristics. In this paper, we compared the revised IG with basic ICA for the DMFSP with makespan criterio
APA, Harvard, Vancouver, ISO, and other styles
27

Peng, Ting-Chia, and 彭亭嘉. "Distributed Flowshop Scheduling Problems with Predictive Maintenance." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/2m4f32.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系碩士班<br>101<br>With the increase of multinational, with high quality, low cost and low risk of multi-plant production model has been adopted by many companies, thereby enabling the distributed flowshop scheduling problems (DFSP) have gradually been more research attention of scholars. Availability of machine based production scheduling important factor, however, the majority of DFSP literature ignores machine availability and assumes that machine is available all the time. In reality, machines physically deteriorate with increased usage and time. Thus, there is an inte
APA, Harvard, Vancouver, ISO, and other styles
28

Yang, Dar-Li, and 楊達立. "Some Generalized Two-Machine Flowshop Scheduling Problem." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/66011464809492698777.

Full text
Abstract:
博士<br>國立清華大學<br>工業工程研究所<br>82<br>Since Johnson, in his pioneering work, proposed a polynominal time algorithm for the two-machine flowshop scheduling problem. The flowshop scheduling problems have been studied extensively. However, due to the simplicity of the convertional models, they can not be successfully implemented in some practical scheduling problem with reprocessing operations, the scheduling problem with limited waiting time constraints, the scheduling problem with processing time
APA, Harvard, Vancouver, ISO, and other styles
29

Lin, Zhi-Yu, and 林志諭. "Genetic algorithm for multi-objective flowshop scheduling problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/15601955448224589260.

Full text
Abstract:
碩士<br>國立勤益科技大學<br>工業工程與管理系<br>97<br>This paper explores the Pareto optimal solutions for solving multi-objective combinatorial optimization problems. It is necessary to consider the convergence and diversity. This paper proposes a heuristic, LH algorithm, based on Genetic algorithm (GA) for flowshop scheduling problem with multiple objectives of minimizing makespan, total tardiness and total flow time. The algorithm can provide efficient Pareto optimal solutions for decision makers’ reference. Firstly, it refers NEH and modified NEH algorithms to produce several good initial solutions. For sea
APA, Harvard, Vancouver, ISO, and other styles
30

He, Cheng-Ding, and 何承鼎. "Distributed Flowshop Scheduling Problems with No-idle Constraint." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/cxnmn3.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系碩士班<br>103<br>In the no-idle flowshop scheduling problem, machines cannot be idled after finishing one job and before starting the next one. In practical, machines show this behavior as it might be technically unfeasible or uneconomical to stop a machine between jobs. For instance, productions of integrated circuit via photolithography, steel making and fiberglass processing, among others. Flowshop scheduling research has been focused with the recent changes in the processing environment, from a single factory slowly transformed into the trend of many factories. There
APA, Harvard, Vancouver, ISO, and other styles
31

"Scheduling the hybrid flowshop : branch and bounnd algorithms." Université catholique de Louvain, 1999. http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-11262003-101952/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Yang, Ching-I., and 楊清一. "Hybrid Particle Swarm Optimizations for Flowshop Scheduling Problems." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/35126852320955355102.

Full text
Abstract:
博士<br>國立高雄第一科技大學<br>工程科技研究所<br>101<br>Traditional particle swarm optimization (PSO) has the tendency to be trapped at local optimal solution or premature convergence and cannot improve the solutions by fine-tuning. In this dissertation, we utilize the concept of PSO with non-linear time varying evolution (PSO-NTVE) to approach the optimal solutions for flowshop scheduling problems (FSPs). Two hybrid PSO approaches for FSPs are developed. First, hybrid Taguchi-based PSO (HTPSO) is proposed with three features which are different from the existing methods: (I) enhancement of search capability by
APA, Harvard, Vancouver, ISO, and other styles
33

Liu, Jian-Kuan, and 劉鑑寬. "Scheduling for M-Machine Jumping No-Wait Flowshop." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/24691995275188223976.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程與管理學系<br>98<br>This study investigates the scheduling of jumping no-wait flowshop(JNWF) problems. These problems have a constraint that jobs can not wait for machine during production process; the sequencing of jobs by the machine is similar, but due to the difference of jobs' types, jobs may skip some process of machines. This research is based on the specific of JNWF sequencing problems, with the minimum makespan as the target. By deriving 2 new algorithms (FBS and FBS2) from tabu search, we determine the priority of the jobs from the machine. 4 methods (FBS, FBS2, Li’s T
APA, Harvard, Vancouver, ISO, and other styles
34

Hung, Chun Hung, and 洪正鴻. "Mathematical and Heuristic Modelling in Flowshop Scheduling with Unrelated." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/12977708623132183220.

Full text
Abstract:
碩士<br>大葉大學<br>工業工程學系碩士班<br>91<br>In this research, a non-identical parallel machine flow shop scheduling problem of minimizing mean flow time is considered. In the past few years, in order to simplify the scheduling problem, most of research assumes setup and removal times are even negligible or part of the processing time. In this research, we look the setup, processing, and removal times as separatable, then take the sequence-independent setup and dependent removal times into account. To solve the addressed problem two different solving models are developed. First, a 0-1 integer programming
APA, Harvard, Vancouver, ISO, and other styles
35

Chou, Fuh-Der, and 周富得. "A Study On The Flowshop Scheduling With Bicriteria Problems." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/41530117303742946208.

Full text
Abstract:
博士<br>國立交通大學<br>工業工程與管理學系<br>85<br>To increase a flowshop performance, to lower both throughput time and work inprocess (WIP) as much as possible is necessary. In general, the scheduling criterion on makespan minimization can effectively shorten the throughput time while the scheduling criterion on total flow time minimization can effectively reduce the WIP. This study attempts to minimize the weighted sum of the abovetwo scheduling criteria in a flowshop environment. Three sub-
APA, Harvard, Vancouver, ISO, and other styles
36

Hsiu-Hsiu, Weng, and 翁秀繡. "Genetic Algorithm for Two-stage Hybrid Flowshop scheduling problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/34156437397140462245.

Full text
Abstract:
碩士<br>國立勤益科技大學<br>工業工程與管理系<br>97<br>Several production lines are hybrid flowshop, which are mixed two production systems of flowshop and parallel machines. The machine preventive maintenance or adjustment is needed in a specified period of time, therefore the machine is not available. The two-stage hybrid flowshop includes several machines in each stage and preventive maintenance or adjustment us considered. The paper proposes a heuristic based on gentic algorithm (GA), named GA_H algorithm to minimize makespan.The initial solution of GA_H algorithm are combination JR、SPT、NEH、NEH_R(r) algorit
APA, Harvard, Vancouver, ISO, and other styles
37

林耿漢. "A Tabu Search Approach to Scheduling Flowshop Manufacturing Cell." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/74235747110432827885.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程與管理學系<br>99<br>The tabu-search mechanism, a type of meta-heuristic algorithms, has been widely used in solving complex space-search problems. Most prior research focused on how to apply or enhance the tabu-search mechanism to various problems. Aside from the traditional track, this research examines a new research issue—Can the adoption of a new solution representation scheme improve the performance of the tabu-search mechanism? A scheduling problem called flowshop manufacturing cell with permutation is used as the problem context, and two tabu-search algorithms are compare
APA, Harvard, Vancouver, ISO, and other styles
38

潘冠銘. "A Memetic Algorithm Approach to Scheduling Flowshop Manufacturing Cell." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/33545871708780086907.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程與管理學系<br>99<br>The memetic algorithm, a type of meta-heuristic algorithms, has been widely used in solving complex space-search problems. Most prior research focused on how to apply or enhance the search mechanism to various problems. Aside from the traditional track, this research examines a new research issue—Can the adoption of a new solution representation scheme improve the performance of the memetic algorithm? A flowshop manufacturing cell scheduling problem with permutation is used as the problem context, and two memetic algorithms are compared. The two algorithms, e
APA, Harvard, Vancouver, ISO, and other styles
39

曾偉杰. "A Simulated Annealing Approach To Scheduling Flowshop Manufacturing Cell." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/22184302475067095864.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程與管理學系<br>99<br>Simulated Annealing (SA), a type of meta-heuristic algorithms, has been widely used in solving complex space-search problems. Most prior research focused on how to apply or enhance SA to various problems. Aside from the traditional track, this research examines a new research issue—Can the adoption of a new solution representation scheme improve the performance of SA? A scheduling problem called Flowshop Manufacturing Cell is used as the problem context, and two SAs are compared. The two algorithms, essentially the same in algorithmic flow, are distinct in us
APA, Harvard, Vancouver, ISO, and other styles
40

Hao-tun, Teng, and 鄧浩敦. "A Hybrid Genetic Algorithm for the Flowshop Scheduling Problem." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/46941160360681385525.

Full text
Abstract:
碩士<br>逢甲大學<br>工業工程學系<br>88<br>In past, while studying the flowshop scheduling problem, it is generally assumed that all jobs are equal in importance. In reality, such an assumption need not necessarily hold. For example, jobs have different unit costs and holding costs, and hence they cannot be treated equivalently. In order to solve the problem, in this paper, we study the flowshop scheduling problem with respect to minimizing the total weighted flowtime of jobs. Genetic algorithm has been used widely in many fields and proved of good effect. Some scholars point out that combine g
APA, Harvard, Vancouver, ISO, and other styles
41

Lin, Ya-Tai, and 林亞泰. "A Genetic Local Search Algorithm for Flowshop Scheduling Problems." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/26168249249337274725.

Full text
Abstract:
博士<br>國立中興大學<br>資訊科學與工程學系<br>97<br>The flowshop scheduling problem (FSSP) is a very well-known scheduling problem. Over the past years, the researches on FSSP were aiming at the criterion of makespan minimization. Recently, the FSSP to total flowtime minimization has drawn more researchers’ attention. Besides, researches on no-wait flowshop scheduling problem reflecting to many industries like steel production, food processing, and chemical industry have been increased. In this dissertation, a genetic local search algorithm is proposed to solve the FSSP with both makespan and total flowtime cr
APA, Harvard, Vancouver, ISO, and other styles
42

Lin, Yin-Shan, and 林吟珊. "Distributed Flowshop Scheduling Problems with Sequence-Dependent Setup Times." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/d4rjwz.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系碩士班<br>101<br>Since many industries from a single factory into a multi-mode of production, distribution flowshop scheduling problem scheduling research in recent years become one of the important directions. In face scheduling performance is good or bad is often affected by the setup times. In the past that distribution flowshop scheduling problems studies have ignored the sequence dependent setup time. This research provided two kinds of Iterated Greedy Algorithm (IG) to solve the problem, and verify the solution of efficiency from the proposed Revised Iterated Greed
APA, Harvard, Vancouver, ISO, and other styles
43

Lu, Hsiao-Shan, and 盧筱姍. "Distributed Flowshop Scheduling Problems with Mixed No-idle Constraint." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/th4z2d.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系碩士班<br>105<br>In many times, the companies want to use machines with no-idle. But in practical, considering the cost or technology, and the companies can’t use machines with no-idle. For instance, productions of integrated circuit via photolithography, steel making and fiberglass processing. In recently years, flowshop scheduling has a change in the industry, from a single factory transformed into many factories. More and more companies use flowshop scheduling into their scheduling system. Therefore, this study emphasis on the factory to join the factors and mixed no-
APA, Harvard, Vancouver, ISO, and other styles
44

Yang, Sheng-Fa, and 楊盛發. "Two-Machine No-wait Total Tardiness Flowshop Scheduling Problem." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/ugkp89.

Full text
Abstract:
碩士<br>朝陽科技大學<br>工業工程與管理系碩士班<br>94<br>Abstract The flowshop scheduling problem can be stated as follows. There are n independent jobs and m different machines. There is a common restriction on the order in which the operations of a job are to be performed. Each machine can process at most one job at a time and each job can be processed on one machine at a time. Flowshop scheduling is often encountered in mass production systems. Scheduling problems with no-wait constraints occur in many industries. For instance, in hot metal rolling industries , where the heated metal has to undergo a series of
APA, Harvard, Vancouver, ISO, and other styles
45

Chen, Li-Chiu, and 陳麗秋. "A GA_ENS Algorithm for the Permutation Flowshop Scheduling Problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/uubukk.

Full text
Abstract:
碩士<br>臺中技術學院<br>資訊科技與應用研究所<br>97<br>The permutation flowshop scheduling problem (PFSP) is an important issue in manufacturing. PFSP is the combination of n jobs and m machines of production scheduling problem. Each job must be processed on m machines. All jobs have the same processing procedure but with different processing time. The objective of this paper is to minimize the total completion time of jobs (Minimum Makespan). With the increase number of jobs and machines, the complexity of PFSP increases exponentially. Therefore the optimal solution can not be found in polynomial time. Thus, re
APA, Harvard, Vancouver, ISO, and other styles
46

LIN, PEI-YU, and 林旆伃. "No-wait Flowshop Scheduling Problems with Specified Release Dates." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/w4ec2b.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系<br>107<br>In this thesis, we consider the flowshop scheduling problem with no-wait and the given release date constraints for minimizing makespan. For this problem, a mixed-integer linear programming model programming is proposed and programed on LINGO to obtain the optimal solution of small problems, which can be used as a benchmark for the compared algorithm. Moreover, this thesis proposes a Beam Search (BS) algorithm with a local search (BSLS). BS algorithm takes the parameters of beam width and filter width to determine the number of remaining nodes. The efficien
APA, Harvard, Vancouver, ISO, and other styles
47

Tseng, Hsiu-Wen, and 曾秀文. "No-Wait Flowshop Scheduling with Multi-Stage Parallel Machines." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/40903138643192340799.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程與管理學系<br>98<br>This research deals with the problem of N jobs on parallel machines in S successive stages with the constraint that a job after being processed by the first stage’s machine is not allowed the waiting time between two consecutive operations. We call this problem as no-wait flowshop with parallel machines scheduling problem (NWF-P). The objective is to find a schedule that would minimize the makespan. First, considered the machine idle times, we propose an initial solution, named Revised MDA1 and Revised MDA2, for jobs schedule and the assignment of jobs to mac
APA, Harvard, Vancouver, ISO, and other styles
48

Chou, ShieChieh, and 周世杰. "Batch Scheduling in a Three-Machine Assembly-Type Flowshop." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/77906722976133127486.

Full text
Abstract:
碩士<br>銘傳大學<br>資訊管理研究所<br>89<br>This thesis addresses a three-machine assembly-type flowshop scheduling problem. Machines one and two are fabrication areas arranged as two parallel machines for producing component parts discretely, and machine three is an assembly line arranged as a flowshop for receiving component parts in batches. In this study, we explore useful properties for some special cases and present an NP-hardness proof for a special case. We define a lower bound for solutions to the generic three-machine assembly-type flowshop batch scheduling problem, and then devise several heuris
APA, Harvard, Vancouver, ISO, and other styles
49

Hendizadeh, Naini Seyed Hamed. "Scheduling a flowshop manufacturing cell with sequence dependent setup times." 2008. http://hdl.handle.net/1993/20928.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Tsai, Bifang, and 蔡碧芳. "An Approach of Flowshop Scheduling with Identical Parallel Machine Consideration." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/14351441030670309877.

Full text
Abstract:
碩士<br>大葉大學<br>工業工程學系碩士班<br>91<br>In this research, an identical parallel machine flowshop scheduling problem in which the dependent setup time is taken into account is considered with minimization of total flowtime. The addressed flowshop scheduling problem is more complex than the traditional flowshop scheduling problems since in the addressed flowshop scheduling problem both machine assignment and job sequencing problems are considered simultaneously. To solve the addressed problem two different solving models are developed. First, a 0-1 integer programming model is constructed; however,
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Flowshop Scheduling' for other source types:
Journal articles
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!

To the bibliography