Log in

Relevant bibliographies by topics / Permutacional Flowshop Scheduling Problem / Journal articles

To see the other types of publications on this topic, follow the link: Permutacional Flowshop Scheduling Problem.

Journal articles on the topic 'Permutacional Flowshop Scheduling Problem'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Permutacional Flowshop Scheduling Problem.'

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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Gupta, Jatinder N. D. "Two-Stage, Hybrid Flowshop Scheduling Problem." Journal of the Operational Research Society 39, no. 4 (April 1988): 359. http://dx.doi.org/10.2307/2582115.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Haouari, Mohamed, and Lotfi Hidri. "On the hybrid flowshop scheduling problem." International Journal of Production Economics 113, no. 1 (May 2008): 495–97. http://dx.doi.org/10.1016/j.ijpe.2007.10.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Yang, Dar-Li, and Maw-Sheng Chern. "Two-machine flowshop group scheduling problem." Computers & Operations Research 27, no. 10 (September 2000): 975–85. http://dx.doi.org/10.1016/s0305-0548(99)00070-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gupta, Jatinder N. D. "Two-Stage, Hybrid Flowshop Scheduling Problem." Journal of the Operational Research Society 39, no. 4 (April 1988): 359–64. http://dx.doi.org/10.1057/jors.1988.63.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Naderi, B., and Rubén Ruiz. "The distributed permutation flowshop scheduling problem." Computers & Operations Research 37, no. 4 (April 2010): 754–68. http://dx.doi.org/10.1016/j.cor.2009.06.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Tang, Dan, and Hong Ping Shu. "A Heuristic Algorithm for Flowshop Scheduling Problem." Advanced Materials Research 591-593 (November 2012): 626–30. http://dx.doi.org/10.4028/www.scientific.net/amr.591-593.626.

Full text

Abstract:

Flow Shop Scheduling Problem is a class of scheduling problems with a work shop in which the flow control shall enable an appropriate sequencing for each job and for processing on a set of machines in compliance with given processing orders. In this paper, we propose a new heuristic algorithm based on the analysis and research of which problem, the new method introducing a evaluate mechanism of the relative position of any two jobs to the completion time, and the efficiency and performance has been improved .The result of simulation experiments shows that, our new heuristic algorithm has good performance, and the average quality and stability of scheduling sequences generated by new method is significantly better than other heuristic algorithm which has the same complexity.

APA, Harvard, Vancouver, ISO, and other styles

8

Rajendran, Chandrasekharan. "Two-Stage Flowshop Scheduling Problem with Bicriteria." Journal of the Operational Research Society 43, no. 9 (September 1992): 871. http://dx.doi.org/10.2307/2583288.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sadjadi, S. J., M. B. Aryanezhad, and Mohsen Ziaee. "The General Flowshop Scheduling Problem: Mathematical Models." Journal of Applied Sciences 8, no. 17 (August 15, 2008): 3032–37. http://dx.doi.org/10.3923/jas.2008.3032.3037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

ZHANG, Chang-Sheng, Ji-Gui SUN, Qing-Yun YANG, and Li-Hui ZHENG. "A Hybrid Algorithm for Flowshop Scheduling Problem." Acta Automatica Sinica 35, no. 3 (May 31, 2009): 332–36. http://dx.doi.org/10.3724/sp.j.1004.2009.00332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Chou, Fuh-Der, and Ching-En Lee. "Two-machine flowshop scheduling with bicriteria problem." Computers & Industrial Engineering 36, no. 3 (July 1999): 549–64. http://dx.doi.org/10.1016/s0360-8352(99)00149-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Koulamas, Christos, and George J. Kyparisis. "The three-stage assembly flowshop scheduling problem." Computers & Operations Research 28, no. 7 (June 2001): 689–704. http://dx.doi.org/10.1016/s0305-0548(00)00004-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Rajendran, Chandrasekharan. "Two-Stage Flowshop Scheduling Problem with Bicriteria." Journal of the Operational Research Society 43, no. 9 (December 1993): 871–84. http://dx.doi.org/10.1057/jors.1992.126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

HE, LONGMIN, SHIJIE SUN, and RUNZI LUO. "A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM." Asia-Pacific Journal of Operational Research 24, no. 01 (February 2007): 45–56. http://dx.doi.org/10.1142/s0217595907001036.

Full text

Abstract:

This paper considers a batch scheduling problem in a two-stage hybrid flowshop that consists of m dedicated parallel machines in stage 1 and a batch processor in stage 2. The processing time of a batch is defined as the largest processing time of the jobs contained in that batch. The criterion is to minimize the makespan, the time by which all operations of jobs have been processed. For such a problem, we present a polynomial time algorithm for the case with all jobs having the same processing time on the batch processor. An approximation algorithm with a competitive ratio 2 for the general case is also presented.

APA, Harvard, Vancouver, ISO, and other styles

15

Allahverdi, Ali. "The Tricriteria Two-Machine Flowshop Scheduling Problem." International Transactions in Operational Research 8, no. 4 (July 2001): 403–25. http://dx.doi.org/10.1111/1475-3995.00273.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Hatami, Sara, Rubén Ruiz, and Carlos Andrés-Romano. "The Distributed Assembly Permutation Flowshop Scheduling Problem." International Journal of Production Research 51, no. 17 (September 2013): 5292–308. http://dx.doi.org/10.1080/00207543.2013.807955.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Öztop, Hande, M. Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan, and Levent Kandiller. "An energy-efficient permutation flowshop scheduling problem." Expert Systems with Applications 150 (July 2020): 113279. http://dx.doi.org/10.1016/j.eswa.2020.113279.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Djellab, Housni, and Khaled Djellab. "Preemptive Hybrid Flowshop Scheduling problem of interval orders." European Journal of Operational Research 137, no. 1 (February 2002): 37–49. http://dx.doi.org/10.1016/s0377-2217(01)00094-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Hui Jin, and Gelan Yang. "Solving the Flowshop Scheduling Problem Using Simulated Annealing." INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences 4, no. 23 (December 31, 2012): 575–82. http://dx.doi.org/10.4156/aiss.vol4.issue23.71.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Meziani, Nadjat, Ammar Oulamara, and Mourad Boudhar. "Two-machine flowshop scheduling problem with coupled-operations." Annals of Operations Research 275, no. 2 (August 6, 2018): 511–30. http://dx.doi.org/10.1007/s10479-018-2967-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Yuesheng, Qi, Wang Baozhong, and Kang Lishan. "A genetic algorithm for the flowshop scheduling problem." Wuhan University Journal of Natural Sciences 3, no. 4 (December 1998): 410–12. http://dx.doi.org/10.1007/bf02830040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Vallada, Eva, and Rubén Ruiz. "Cooperative metaheuristics for the permutation flowshop scheduling problem." European Journal of Operational Research 193, no. 2 (March 2009): 365–76. http://dx.doi.org/10.1016/j.ejor.2007.11.049.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Öztop, Hande, M. Fatih Tasgetiren, Deniz Türsel Eliiyi, and Quan-Ke Pan. "Metaheuristic algorithms for the hybrid flowshop scheduling problem." Computers & Operations Research 111 (November 2019): 177–96. http://dx.doi.org/10.1016/j.cor.2019.06.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Eren, Tamer, and Ertan Güner. "A bicriteria flowshop scheduling problem with setup times." Applied Mathematics and Computation 183, no. 2 (December 2006): 1292–300. http://dx.doi.org/10.1016/j.amc.2006.05.160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Eren, Tamer. "A multicriteria flowshop scheduling problem with setup times." Journal of Materials Processing Technology 186, no. 1-3 (May 2007): 60–65. http://dx.doi.org/10.1016/j.jmatprotec.2006.12.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Gupta, Jatinder N. D., and William P. Darrow. "The two-machine sequence dependent flowshop scheduling problem." European Journal of Operational Research 24, no. 3 (March 1986): 439–46. http://dx.doi.org/10.1016/0377-2217(86)90037-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Gharbi, Anis, Mohamed Labidi, and Mohamed Aly Louly. "The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures." Journal of Applied Mathematics 2014 (2014): 1–14. http://dx.doi.org/10.1155/2014/273567.

Full text

Abstract:

We consider the makespan minimization in a flowshop environment where the job sequence does not have to be the same for all the machines. Contrarily to the classical permutation flowshop scheduling problem, this strongly NP-hard problem received very scant attention in the literature. In this paper, some improved single-machine-based adjustment procedures are proposed, and a new two-machine-based one is introduced. Based on these adjustments, new lower and upper bounding schemes are derived. Our experimental analysis shows that the proposed procedures provide promising results.

APA, Harvard, Vancouver, ISO, and other styles

28

Xuan, Hua. "Hybrid Flowshop Scheduling with Finite Transportation Capacity." Applied Mechanics and Materials 65 (June 2011): 574–78. http://dx.doi.org/10.4028/www.scientific.net/amm.65.574.

Full text

Abstract:

This paper studies a class of hybrid flowshop scheduling problem characterized by release time, transportation time and transportation capacity of one unit for each transporter. This problem is formulated as an integer programming model and a Lagrangian relaxation algorithm is designed to solve it. Testing results on problems of small to medium sizes show that the Lagrangian relaxation algorithm can obtain an acceptable near optimal schedule within a shorter CPU time.

APA, Harvard, Vancouver, ISO, and other styles

29

Cao, Ying, Hua Xuan, and Jing Liu. "Dynamic Hybrid Flowshop Scheduling with Batching Production." Applied Mechanics and Materials 65 (June 2011): 562–67. http://dx.doi.org/10.4028/www.scientific.net/amm.65.562.

Full text

Abstract:

Based on the background of steel-tube production, this paper presents the dynamic hybrid flowshop scheduling with batching scheduling at the first stage, and establishes an integer programming model for this problem. The objective is to minimize the total weighted completion time. The Lagrangian relaxation algorithm is constructed to slove the above model where dynamic programming is presented to solve batch-level subproblems, and a two-stage heuristic is presented to construct a feasible schedule. Testing results on small to medium problem sizes show that this method can obtain satisfactory quality solution in a shorter computation time.

APA, Harvard, Vancouver, ISO, and other styles

30

Lebbar, Ghita, Abdellah El Barkany, Abdelouahhab Jabri, and Ikram El Abbassi. "Hybrid Metaheuristics for Solving the Blocking Flowshop Scheduling Problem." International Journal of Engineering Research in Africa 36 (June 2018): 124–36. http://dx.doi.org/10.4028/www.scientific.net/jera.36.124.

Full text

Abstract:

This paper suggests two evolutionary optimization approaches for solving the blocking flow shop scheduling problem with the maximum completion time (makespan) criterion, namely the genetic algorithm (GA) and the simulated annealing genetic algorithms (SAGA) that combines the simulated annealing (SA) with the (GA), respectively. The considered problem and the proposed algorithms have some parameters to be adjusted through a design of experiments with exorbitant runs. In fact, a Taguchi method is presented to study the parameterization problem empirically. The performance of the proposed algorithms is evaluated by applying it to Taillard’s well-known benchmark problem, the experiment results show that the SA combined with GA method is advanced to the GA and to the compared algorithms proposed in the literature in minimizing makespan criterion. Ultimately, new known upper bounds for Taillard’s instances are reported for this problem, which can be used thereafter as a basis of benchmark in eventual investigations.

APA, Harvard, Vancouver, ISO, and other styles

31

Sadjadi, S. J., J. L. Bouquard, and M. Ziaee. "An Ant Colony Algorithm for the Flowshop Scheduling Problem." Journal of Applied Sciences 8, no. 21 (October 15, 2008): 3938–44. http://dx.doi.org/10.3923/jas.2008.3938.3944.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

ZHANG, Qi-liang, Yong-sheng CHEN, and Bin HAN. "Improved particle swarm optimization for permutation flowshop scheduling problem." Journal of Computer Applications 32, no. 4 (April 8, 2013): 1022–24. http://dx.doi.org/10.3724/sp.j.1087.2012.01022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Koulamas, Christos. "A new constructive heuristic for the flowshop scheduling problem." European Journal of Operational Research 105, no. 1 (February 1998): 66–71. http://dx.doi.org/10.1016/s0377-2217(97)00027-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Jin, Zhihong, Zan Yang, and Takahiro Ito. "Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem." International Journal of Production Economics 100, no. 2 (April 2006): 322–34. http://dx.doi.org/10.1016/j.ijpe.2004.12.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Iyer, Srikanth K., and Barkha Saxena. "Improved genetic algorithm for the permutation flowshop scheduling problem." Computers & Operations Research 31, no. 4 (April 2004): 593–606. http://dx.doi.org/10.1016/s0305-0548(03)00016-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Gupta, J. N. D. "A flowshop scheduling problem with two operations per job." International Journal of Production Research 35, no. 8 (August 1997): 2309–26. http://dx.doi.org/10.1080/002075497194868.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Rajkumar, R., and P. Shahabudeen. "An improved genetic algorithm for the flowshop scheduling problem." International Journal of Production Research 47, no. 1 (November 15, 2008): 233–49. http://dx.doi.org/10.1080/00207540701523041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

HINO, Rei, Daisuke UEKAWA, Masanori MORIKAWA, Norikazu SUZUKI, and Eiji SHAMOTO. "Study on Re-entrant Flowshop Scheduling Problem(1st report)." Journal of the Japan Society for Precision Engineering 74, no. 10 (2008): 1119–24. http://dx.doi.org/10.2493/jjspe.74.1119.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

HINO, Rei, Daisuke UEKAWA, Masanori MORIKAWA, Norikazu SUZUKI, and Eiji SHAMOTO. "Study on Re-entrant Flowshop Scheduling Problem(2nd report)." Journal of the Japan Society for Precision Engineering 74, no. 11 (2008): 1225–30. http://dx.doi.org/10.2493/jjspe.74.1225.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Kuiteing, Aimé Kamgaing, Ammar Oulamara, and Gerd Finke. "FLOWSHOP SCHEDULING PROBLEM WITH BATCHING MACHINES AND TASK COMPATIBILITIES." IFAC Proceedings Volumes 39, no. 3 (2006): 39–44. http://dx.doi.org/10.3182/20060517-3-fr-2903.00025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Wang, Ning, Reinaldo J. Moraga, and Omar Ghrayeb. "A modified rapid access heuristic for flowshop scheduling problem." International Journal of Applied Management Science 3, no. 4 (2011): 327. http://dx.doi.org/10.1504/ijams.2011.042948.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Sen, Tapan, Parthasarati Dileepan, and Jatinder N. D. Gupia. "The two-machine flowshop scheduling problem with total tardiness." Computers & Operations Research 16, no. 4 (January 1989): 333–40. http://dx.doi.org/10.1016/0305-0548(89)90005-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Haq, A. Noorul, M. Saravanan, A. R. Vivekraj, and T. Prasad. "A scatter search approach for general flowshop scheduling problem." International Journal of Advanced Manufacturing Technology 31, no. 7-8 (January 26, 2006): 731–36. http://dx.doi.org/10.1007/s00170-005-0244-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Framinan, Jose M., and Paz Perez-Gonzalez. "On heuristic solutions for the stochastic flowshop scheduling problem." European Journal of Operational Research 246, no. 2 (October 2015): 413–20. http://dx.doi.org/10.1016/j.ejor.2015.05.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Gooding, W. B., J. F. Pekny, and P. S. McCroskey. "Enumerative approaches to parallel flowshop scheduling via problem transformation." Computers & Chemical Engineering 18, no. 10 (October 1994): 909–27. http://dx.doi.org/10.1016/0098-1354(94)e0029-m.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Costa, Wagner Emanoel, Marco César Goldbarg, and Elizabeth G. Goldbarg. "New VNS heuristic for total flowtime flowshop scheduling problem." Expert Systems with Applications 39, no. 9 (July 2012): 8149–61. http://dx.doi.org/10.1016/j.eswa.2012.01.152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Li, Yuan-Zhen, Quan-Ke Pan, Kai-Zhou Gao, M. Fatih Tasgetiren, Biao Zhang, and Jun-Qing Li. "A green scheduling algorithm for the distributed flowshop problem." Applied Soft Computing 109 (September 2021): 107526. http://dx.doi.org/10.1016/j.asoc.2021.107526.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Bahari, M. Faudzi, Sudrajat Sudrajat, and E. Lesmana. "Minimize Rental Costs on Flowshop Scheduling." JURNAL ILMIAH SAINS 20, no. 2 (May 25, 2020): 58. http://dx.doi.org/10.35799/jis.20.2.2020.27765.

Full text

Abstract:

ABSTRACTThis paper discusses solving the problem of rental costs in a Flowshop scheduling with n-jobs and m-Machines in small and medium-sized companies to minimize rental costs to be paid. The proposed method is the development of an existing method using several proven propositions. The method used is applied in a sandals company that rents 11 machines used to produce 6 types of products. The proposed method yields a rental fee of IDR 1,071,121.5.Keywords: Flow shop; minimize rental cost; scheduling Minimisasi Biaya Sewa pada Penjadwalan FlowshopABSTRAKPaper ini membahas mengenai minimisasi biaya sewa yang harus dibayar oleh perusahaan berskala kecil-menengah yang menggunakan penjadwalan flowshop dengan n-buah pekerjaan yang dikerjakan oleh m-buah mesin pada proses produksinya. Metode yang dibuat adalah pengembangan dari metode sebelumnya yang dibuktikan dengan menggunakan beberapa proposisi pendukung. Metode ini telah diaplikasikan pada sebuah perusahaan sandal yang memproduksi 6 jenis sandal dengan menggunakan 11 mesin yang berbeda. Berdasarkan metode ini perusahaan harus membayar biaya sewa mesin sebesar Rp. 1,071,121.5.Kata Kunci: Flow shop; minimisasi biaya sewa; penjadwalan

APA, Harvard, Vancouver, ISO, and other styles

49

CELANO, G., A. COSTA, and S. FICHERA. "AN EVOLUTIONARY ALGORITHM FOR PURE FUZZY FLOWSHOP SCHEDULING PROBLEMS." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 11, no. 06 (December 2003): 655–69. http://dx.doi.org/10.1142/s0218488503002466.

Full text

Abstract:

The pure flowshop scheduling problem is here investigated from a perspective considering me uncertainty associated with the execution of shop floor activities. Being the flowshop problem is NP complete, a large number of heuristic algorithms have been proposed in literature to determine an optimal solution. Unfortunately, these algorithms usually assume a simplifying hypothesis: the problem data are assumed as deterministic, i.e. job processing times and the due dates are expressed through a unique value, which does not reflect the real process variability. For this reason, some authors have recently proposed the use of a fuzzy set theory to model the uncertainty in scheduling problems. In this paper, a proper genetic algorithm has been developed for solving the fuzzy flowshop scheduling problem. The optimisation involves two different objectives: the completion time minimisation and the due date fulfilment; both the single and multi-objective configurations have been considered. A new ranking criterion has been proposed and its performance has been tested through a set of test problems. A numerical analysis confirms the efficiency of the proposed optimisation procedure.

APA, Harvard, Vancouver, ISO, and other styles

50

HU, XIAOFENG, JINGSONG BAO, and YE JIN. "A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD." Asia-Pacific Journal of Operational Research 26, no. 06 (December 2009): 817–29. http://dx.doi.org/10.1142/s0217595909002493.

Full text

Abstract:

This paper focuses on scheduling problem of a pipe-processing flowshop in a shipyard. The flowshop composes of five stages, including cutting, bending, welding preprocessing, argon-welding and CO 2-welding, and each stage consists of identical parallel machines. Since thousands of pipes are mounted on the hull block before erection, the pipe-processing scheduling is a critical task for shipbuilding to meet the due date of the block erection. A tabu search algorithm is developed for the scheduling problem with the objective of minimizing total tardiness. Computational experiments are performed on the collected real data. Results show that the proposed algorithm is efficient for this problem.

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!