Log in

Relevant bibliographies by topics / Flowshop Scheduling

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Flowshop Scheduling"

1

Choi, Seong Woo. "Heuristics for an m-Machine Re-Entrant Permutation Flowshop with the Objective of Total Tardiness." Applied Mechanics and Materials 752-753 (April 2015): 890–95. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.890.

Full text

Abstract:

We focus on an m-machine re-entrant flowshop scheduling problem with the objective of minimizing total tardiness. In the re-entrant flowshop considered here, routes of all jobs are identical as in ordinary flowshops, but the jobs must be processed multiple times on the machines. We present heuristic algorithms, which are modified from well-known existing algorithms for the general m-machine flowshop problem or newly developed in this paper. For evaluation of the performance of the algorithms, computational experiments are performed on randomly generated test problems and results are reported.

APA, Harvard, Vancouver, ISO, and other styles

2

Rossi, Andrea, and Michele Lanzetta. "Nonpermutation flow line scheduling by ant colony optimization." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 27, no. 4 (2013): 349–57. http://dx.doi.org/10.1017/s0890060413000176.

Full text

Abstract:

AbstractA flow line is a conventional manufacturing system where all jobs must be processed on all machines with the same operation sequence. Line buffers allow nonpermutation flowshop scheduling and job sequences to be changed on different machines. A mixed-integer linear programming model for nonpermutation flowshop scheduling and the buffer requirement along with manufacturing implication is proposed. Ant colony optimization based heuristic is evaluated against Taillard's (1993) well-known flowshop benchmark instances, with 20 to 500 jobs to be processed on 5 to 20 machines (stages). Comput

APA, Harvard, Vancouver, ISO, and other styles

3

Allahverdi, Ali, Tariq Aldowaisan, and Yuri N. Sotskov. "Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times." International Journal of Mathematics and Mathematical Sciences 2003, no. 39 (2003): 2475–86. http://dx.doi.org/10.1155/s016117120321019x.

Full text

Abstract:

This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given.

APA, Harvard, Vancouver, ISO, and other styles

4

Frostig, E., and I. Adiri. "Stochastic flowshop no-wait scheduling." Journal of Applied Probability 22, no. 1 (1985): 240–46. http://dx.doi.org/10.2307/3213765.

Full text

Abstract:

This paper deals with special cases of stochastic flowshop, no-wait, scheduling. n jobs have to be processed by m machines . The processing time of job Ji on machine Mj is an independent random variable Ti. It is possible to sequence the jobs so that , . At time 0 the realizations of the random variables Ti, (i are known. For m (m ≧ 2) machines it is proved that a special SEPT–LEPT sequence minimizes the expected schedule length; for two (m = 2) machines it is proved that the SEPT sequence minimizes the expected sum of completion times.

APA, Harvard, Vancouver, ISO, and other styles

5

Frostig, E., and I. Adiri. "Stochastic flowshop no-wait scheduling." Journal of Applied Probability 22, no. 01 (1985): 240–46. http://dx.doi.org/10.1017/s0021900200029181.

Full text

Abstract:

This paper deals with special cases of stochastic flowshop, no-wait, scheduling. n jobs have to be processed by m machines . The processing time of job Ji on machine Mj is an independent random variable Ti . It is possible to sequence the jobs so that , . At time 0 the realizations of the random variables Ti , ( i are known. For m (m ≧ 2) machines it is proved that a special SEPT–LEPT sequence minimizes the expected schedule length; for two (m = 2) machines it is proved that the SEPT sequence minimizes the expected sum of completion times.

APA, Harvard, Vancouver, ISO, and other styles

6

Ho, Johnny C., and Jatinder N. D. Gupta. "Flowshop scheduling with dominant machines." Computers & Operations Research 22, no. 2 (1995): 237–46. http://dx.doi.org/10.1016/0305-0548(94)e0007-t.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Randhawa, Sabah U., Cynthia Juwono, and Sheikh Burhanuddin. "Scheduling in Multistage Flowshop Systems." Industrial Management & Data Systems 94, no. 5 (1994): 16–24. http://dx.doi.org/10.1108/02635579410063270.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bernstein, M. "Finding heuristics for flowshop scheduling." ACM SIGART Bulletin, no. 99 (January 1987): 32–33. http://dx.doi.org/10.1145/24667.24670.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Eren, Tamer, and Ertan Güner. "The tricriteria flowshop scheduling problem." International Journal of Advanced Manufacturing Technology 36, no. 11-12 (2007): 1210–20. http://dx.doi.org/10.1007/s00170-007-0931-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Cheng, Chen-Yang, Shih-Wei Lin, Pourya Pourhejazy, Kuo-Ching Ying, and Yu-Zhe Lin. "No-Idle Flowshop Scheduling for Energy-Efficient Production: An Improved Optimization Framework." Mathematics 9, no. 12 (2021): 1335. http://dx.doi.org/10.3390/math9121335.

Full text

Abstract:

Production environment in modern industries, like integrated circuits manufacturing, fiberglass processing, steelmaking, and ceramic frit, is characterized by zero idle-time between inbound and outbound jobs on every machine; this technical requirement improves energy efficiency, hence, has implications for cleaner production in other production situations. An exhaustive review of literature is first conducted to shed light on the development of no-idle flowshops. Considering the intractable nature of the problem, this research also develops an extended solution method for optimizing the Bi-ob

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Flowshop Scheduling"

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

More sources

Books on the topic "Flowshop Scheduling"

1

Moursli, Omar. Scheduling the hybrid flowshop: Branch and bound algorithms. CIACO, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems. IOS Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kamal-Abadi, Isa Nakhai. Flowshop scheduling problems with no=wait and blocking environments: A mathematical programming approach. 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Michael Yingmeng. Scheduling in flowshops with reentrant flows and pallet requirements. 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Flowshop Scheduling"

1

Bierwirth, Christian. "Flowshop Scheduling." In Flowhop Scheduling mit parallelen Genetischen Algorithmen. Deutscher Universitätsverlag, 1993. http://dx.doi.org/10.1007/978-3-322-85617-3_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bagchi, Tapan P. "Flowshop Scheduling." In Multiobjective Scheduling by Genetic Algorithms. Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5237-6_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bagchi, Tapan P. "Multiobjective Flowshop Scheduling." In Multiobjective Scheduling by Genetic Algorithms. Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5237-6_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chakraborty, Uday K. "New Heuristics for Flowshop Scheduling." In Applications and Science in Soft Computing. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-45240-9_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Nural, Ece, Ceren Sanisoğlu, Esennur Ermiş, Sinem Ünver, Zehra Gürçay, and Zehra Düzgit. "Hybrid Flowshop Scheduling Problem at DrPaste." In Lecture Notes in Mechanical Engineering. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-62784-3_59.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Jukuntla, Amar. "Optimization Technique for Flowshop Scheduling Problem." In Advances in Intelligent Systems and Computing. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-7868-2_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bagchi, Tapan P. "A New Genetic Algorithm for Sequencing the Multiobjective Flowshop." In Multiobjective Scheduling by Genetic Algorithms. Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5237-6_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bagchi, Tapan P. "A Comparison of Multiobjective Flowshop Sequencing by NSGA and ENGA." In Multiobjective Scheduling by Genetic Algorithms. Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5237-6_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Frasch, Janick V., Sven Oliver Krumke, and Stephan Westphal. "MIP Formulations for Flowshop Scheduling with Limited Buffers." In Theory and Practice of Algorithms in (Computer) Systems. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19754-3_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Marmion, Marie-Eléonore, Clarisse Dhaenens, Laetitia Jourdan, Arnaud Liefooghe, and Sébastien Verel. "On the Neutrality of Flowshop Scheduling Fitness Landscapes." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25566-3_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Flowshop Scheduling"

1

Chang, Pei Chann, Shih Hsin Chen, Qingfu Zhang, and Jun Lin Lin. "MOEA/D for flowshop scheduling problems." In 2008 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2008. http://dx.doi.org/10.1109/cec.2008.4630982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Liu, Bo, Juan-Juan Xu, Bin Qian, Jian-Rong Wang, and Yan-Bin Chu. "Probabilistic memetic algorithm for flowshop scheduling." In 2013 IEEE Workshop on Memetic Computing (MC). IEEE, 2013. http://dx.doi.org/10.1109/mc.2013.6608208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Benkel, Kathrin, Kurt Jornsten, and Rainer Leisten. "Variability aspects in flowshop scheduling systems." In 2015 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2015. http://dx.doi.org/10.1109/iesm.2015.7380146.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chakraborty, U. K., D. Lah, and M. Chakraborty. "A heuristic genetic algorithm for flowshop scheduling." In Proceedings 23rd International Conference Information Technology Interfaces. ITI 2001. IEEE, 2001. http://dx.doi.org/10.1109/iti.2001.938035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Dugardin, Frederic, Lionel Amodeo, and Farouk Yalaoui. "Multiobjective scheduling of a reentrant hybrid flowshop." In Industrial Engineering (CIE39). IEEE, 2009. http://dx.doi.org/10.1109/iccie.2009.5223775.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lin, Bertrand M. T., and Yin-Yu Lin. "Two-machine flowshop scheduling with supportive constraints." In Industrial Engineering (CIE-40). IEEE, 2010. http://dx.doi.org/10.1109/iccie.2010.5668160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Yamada, T. "Permutation flowshop scheduling by genetic local search." In Second International Conference on Genetic Algorithms in Engineering Systems. IEE, 1997. http://dx.doi.org/10.1049/cp:19971186.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mahdavi, I., Gh M. Komaki, and V. Kayvanfar. "Aggregate hybrid flowshop scheduling with assembly operations." In 2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management. IEEE, 2011. http://dx.doi.org/10.1109/icieem.2011.6035244.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mansouri, S. Afshin, S. Hamed Hendizadeh, and Nasser Salmasi. "Bicriteria two-machine flowshop scheduling using metaheuristics." In the 9th annual conference. ACM Press, 2007. http://dx.doi.org/10.1145/1276958.1277139.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Tanohata, H., T. Kaihara, and N. Fujii. "A Research on Flowshop Scheduling Problems With Column Generation." In ASME/ISCIE 2012 International Symposium on Flexible Automation. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/isfa2012-7171.

Full text

Abstract:

Column generation is a method to calculate lowerbound for combinatorial optimization problems, although a feasible schedule is generally obtained with the upperbound. Therefore, in this paper, a new method is proposed to solve the flowshop scheduling problems with column generation, which is composed of the local search and duality gap termination condition. The neighborhood of the local search is composed of columns, and the method is applied in column generation to improve the upperbound and lowerbound. The effectiveness of the proposed method is verified by computational experiments.

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!