Relevant bibliographies by topics / Generalized tardiness flow shop

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Generalized tardiness flow shop'

Author: Grafiati
Published: 3 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Generalized tardiness flow 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.

Journal articles on the topic "Generalized tardiness flow shop"

1

Park, Myoung-Ju, Byung-Cheon Choi, Yunhong Min, and Kyung Min Kim. "Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates." Asia-Pacific Journal of Operational Research 37, no. 01 (2020): 1950032. http://dx.doi.org/10.1142/s0217595919500325.

Full text
Abstract:
We consider a two-machine flow shop scheduling with two properties. The first is that each due date is assigned for a specific position different from the traditional definition of due dates, and the second is that a consistent pattern exists in the processing times within each job and each machine. The objective is to minimize maximum tardiness, total tardiness, or total number of tardy jobs. We prove the strong NP-hardness and inapproximability, and investigate some polynomially solvable cases. Finally, we develop heuristics and verify their performances through numerical experiments.
APA, Harvard, Vancouver, ISO, and other styles
2

Farhad, Ghassemi-Tari, and Meshkinfam Sareh. "Improving Performance of GAs by Use of Selective Breading Evolutionary Process." Improving Performance of GAs by Use of Selective Breading Evolutionary Process 22, no. 3 (2017): 1–21. https://doi.org/10.9734/BJMCS/2017/33498.

Full text
Abstract:
In this paper, the use of selective breading evolutionary process for improving the performance of GAs is evaluated. To accomplish this evaluation, the generalized tardiness flow shop scheduling (GTFS) problem is designated. A natural evolutionary GA and two selective breeding Gas are developed for evaluating their performances in solving the proposed problem. An extensive numerical experiment on total of 2250 randomly generated scenarios is conducted to compare the effects of selective breeding mechanism. The effects of the varieties factors on the solution of the algorithms are analyzed by t
APA, Harvard, Vancouver, ISO, and other styles
3

İnal, Ali Fırat, Çağrı Sel, Adnan Aktepe, Ahmet Kürşad Türker, and Süleyman Ersöz. "A Multi-Agent Reinforcement Learning Approach to the Dynamic Job Shop Scheduling Problem." Sustainability 15, no. 10 (2023): 8262. http://dx.doi.org/10.3390/su15108262.

Full text
Abstract:
In a production environment, scheduling decides job and machine allocations and the operation sequence. In a job shop production system, the wide variety of jobs, complex routes, and real-life events becomes challenging for scheduling activities. New, unexpected events disrupt the production schedule and require dynamic scheduling updates to the production schedule on an event-based basis. To solve the dynamic scheduling problem, we propose a multi-agent system with reinforcement learning aimed at the minimization of tardiness and flow time to improve the dynamic scheduling techniques. The per
APA, Harvard, Vancouver, ISO, and other styles
4

Koulamas, Christos. "The proportionate flow shop total tardiness problem." European Journal of Operational Research 284, no. 2 (2020): 439–44. http://dx.doi.org/10.1016/j.ejor.2020.01.002.

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

Bestari, Hana Merlina Hesti, Pratya Poeri Suryadhini, and Nopendri Nopendri. "Flow Shop Scheduling Using a Combination of Ant Colony Optimization Algorithm and Tabu Search Algorithm to Minimize Total Tardiness." Jurnal Teknik Industri: Jurnal Hasil Penelitian dan Karya Ilmiah dalam Bidang Teknik Industri 10, no. 2 (2024): 383. http://dx.doi.org/10.24014/jti.v10i2.32320.

Full text
Abstract:
This paper addresses the problem of production tardiness on five parallel production floors at PT Garmen X, each with an identical machine arrangement. The proposed method combines Ant Colony Optimization (ACO) and Tabu Search (TS) algorithms for flow shop scheduling problems. ACO acts as the primary method for finding the optimal solution. At the same time, the Tabu Search algorithm is applied as a local search to improve the quality of the solution found by ACO. The results show significant performance improvement, with a decrease in total tardiness by 88.09% and a reduction in total makespa
APA, Harvard, Vancouver, ISO, and other styles
6

De Bontridder, K. M. J. "Minimizing Total Weighted Tardiness in a Generalized Job Shop." Journal of Scheduling 8, no. 6 (2005): 479–96. http://dx.doi.org/10.1007/s10951-005-4779-7.

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

Pan, Jason Chao-Hsien, Jen-Shiang Chen, and Chii-Ming Chao. "Minimizing tardiness in a two-machine flow-shop." Computers & Operations Research 29, no. 7 (2002): 869–85. http://dx.doi.org/10.1016/s0305-0548(00)00090-3.

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

Faccio, Maurizio, Mojtaba Nedaei, and Francesco Pilati. "A Comparative Analysis of Job Scheduling for Optimum Performance of Parallel Machines by Considering the Energy Consumption." European Journal of Engineering Research and Science 3, no. 9 (2018): 6. http://dx.doi.org/10.24018/ejers.2018.3.9.841.

Full text
Abstract:
In this study, a comparative analysis of scheduling of machines and jobs was conducted by proposing a method, which aims to optimize the performance of the job-shop environment. A wide range of objective functions including make-span, maximum tardiness, total flow time, total tardiness, total weighted flow time, and total weighted tardiness, and energy consumption. The decision variables of a manufacturing company including the job’s weight, stating and completion time, due dates, releasing date, and processing time were considered as inputs of the optimization model. Then, subject to the defi
APA, Harvard, Vancouver, ISO, and other styles
9

Faccio, Maurizio, Mojtaba Nedaei, and Francesco Pilati. "A Comparative Analysis of Job Scheduling for Optimum Performance of Parallel Machines by Considering the Energy Consumption." European Journal of Engineering and Technology Research 3, no. 9 (2018): 6–11. http://dx.doi.org/10.24018/ejeng.2018.3.9.841.

Full text
Abstract:
In this study, a comparative analysis of scheduling of machines and jobs was conducted by proposing a method, which aims to optimize the performance of the job-shop environment. A wide range of objective functions including make-span, maximum tardiness, total flow time, total tardiness, total weighted flow time, and total weighted tardiness, and energy consumption. The decision variables of a manufacturing company including the job’s weight, stating and completion time, due dates, releasing date, and processing time were considered as inputs of the optimization model. Then, subject to the defi
APA, Harvard, Vancouver, ISO, and other styles
10

Onwubolu, Godfrey C., and Michael Mutingi. "Genetic algorithm for minimizing tardiness in flow-shop scheduling." Production Planning & Control 10, no. 5 (1999): 462–71. http://dx.doi.org/10.1080/095372899232993.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Generalized tardiness flow shop"

1

Ta, Quang-Chieu. "Matheuristic algorithms for minimizing total tardiness in flow shop scheduling problems." Thesis, Tours, 2015. http://www.theses.fr/2015TOUR4002/document.

Full text
Abstract:
Nous considérons dans cette thèse un problème d’ordonnancement de flow-shop de permutation où un ensemble de travaux doit être ordonnancé sur un ensemble de machines. Les travaux doivent être ordonnancés sur les machines dans le même ordre. L’objectif est de minimiser le retard total. Nous proposons des algorithmes heuristiques et des nouvelles matheuristiques pour ce problème. Les matheuristiques sont un nouveau type d’algorithmes approchés qui ont été proposés pour résoudre des problèmes d’optimisation combinatoire. Les méthodes importent de la résolution exacte au sein des approches (méta)
APA, Harvard, Vancouver, ISO, and other styles
2

Vasquez, Julio Cesar Delgado. "Programação de tarefas em um ambiente flow shop com m máquinas para a minimização do desvio absoluto total de uma data de entrega comum." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11122017-123449/.

Full text
Abstract:
Neste trabalho abordamos o problema de programação de tarefas em um ambiente flow shop permutacional com mais de duas máquinas. Restringimos o estudo para o caso em que todas as tarefas têm uma data de entrega comum e restritiva, e onde o objetivo é minimizar a soma total dos adiantamentos e atrasos das tarefas em relação a tal data de entrega. É assumido também um ambiente estático e determinístico. Havendo soluções com o mesmo custo, preferimos aquelas que envolvem menos tempo de espera no buffer entre cada máquina. Devido à dificuldade de resolver o problema, mesmo para instâncias pequenas
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

Huang, Pei-shiuan, and 黃培軒. "Minimizing Total Tardiness in Flow Shop Scheduling Problem with Blocking." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/52150151688222804937.

Full text
Abstract:
碩士<br>國立中央大學<br>工業管理研究所<br>103<br>This research considers the flow shop scheduling problem with blocking to minimize total tardiness where this problem appears in serial manufacturing processes. There are no buffers between adjacent machines in these processes and a completed job has to stay on a machine until the next downstream machine is available. We propose a lower bound which considers the blocking constraint and several propositions to determine the position of the next unscheduled job and a dominance criterion for comparing two selected sequences. The NEH-EDD heuristic provides a feasi
APA, Harvard, Vancouver, ISO, and other styles
5

Jhong, Cheng-Ruei, and 鍾承叡. "Two-Machine Flow Shop Scheduling Problem with Blocking for Minimizing Total Tardiness." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/73946716093643842354.

Full text
Abstract:
碩士<br>國立中央大學<br>工業管理研究所<br>102<br>This paper considers a flow shop scheduling problem with blocking where the objective is to minimize total tardiness. There are two machines and n jobs, each job has different due date and the sequence of job is decided by machine 1. In two-machine flow shop with blocking scheduled problem, there are zero capacity buffer between machines and the job of completing is block on machine until the next downstream machine is available. The total tardiness will increase by influence of blocking constraint. We use branch and bound algorithm to find out an optimal sequ
APA, Harvard, Vancouver, ISO, and other styles
6

Hsieh, Shang-Yen, and 謝尚諺. "Minimizing Total Weighted Tardiness and Carbon Emission for Permutation Flow Shop Scheduling Problems." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/7gkb7b.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理系碩士班<br>102<br>In todays globalized environment,the company heavily emphasise reducing carbon emission, therefore this study examines carbon emission within the context of production scheduling.In this study, a revised multi-start simulated-annealing algorithm (RMSA) is presented for permutation flowshop scheduling problems with the objectives of minimizing the carbon emission and total weighted tardiness. To evaluate the performance of the RMSA, computational experiments were conducted on the well-known benchmark problem set provided by Taillard. The non-dominated set
APA, Harvard, Vancouver, ISO, and other styles
7

Huang, Po-Wei, and 黃柏維. "Earliness and Tardiness in Fuzzy Flow Shop Scheduling Problem Based on Possibility and Necessity Measures." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/02425789610400409056.

Full text
Abstract:
碩士<br>國立高雄師範大學<br>數學系<br>95<br>The scheduling problem with fuzzy processing times and fuzzy due dates are concerned in this thesis. The fuzzy earliness and fuzzy tardiness are proposed based on the concepts of subtraction and maximum of any two fuzzy numbers, which are defined by using the well-known &apos;&apos;Extension Principle'' in fuzzy sets theory. The objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness through the concept of addition among fuzzy numbers. In this case, the objective function turns into a fuzzy-valued function. The purpose of this thesi
APA, Harvard, Vancouver, ISO, and other styles
8

Ruan, Shu-Yi, and 阮舒宜. "A Branch and Bound Algorithm for Total Tardiness Minimization in a Two-machine Flow Shop with Blocking." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/31159529853836766764.

Full text
Abstract:
碩士<br>國立中央大學<br>工業管理研究所<br>104<br>This study deals with the two-machine flowshop scheduling problem with blocking to minimize total tardiness. The blocking flowshop scheduling problem (BFSP) occurs in a variety production processes where no intermediate buffer exists between machines. In practice, because of the lack of intermediary storage or technical requirements, the feature of blocking should be considered. Such as chemical industry, because there are no buffer storage between machines, a job completed processing on machine 1 has to remain on this machine and to block itself until the nex
APA, Harvard, Vancouver, ISO, and other styles
9

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

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

Book chapters on the topic "Generalized tardiness flow shop"

1

Tasgetiren, M. Fatih, Quan-Ke Pan, P. N. Suganthan, Yun-Chia Liang, and Tay Jin Chua. "Metaheuristics for Common due Date Total Earliness and Tardiness Single Machine Scheduling Problem." In Computational Intelligence in Flow Shop and Job Shop Scheduling. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02836-6_10.

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

Nouha, Nouri, and Ladhari Talel. "Total Tardiness Minimization in a Flow Shop with Blocking Using an Iterated Greedy Algorithm." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33625-1_9.

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

Nagano, Marcelo Seido, Mauricio Iwama Takano, and João Vítor Silva Robazzi. "A Branch-and-Bound for the Blocking Permutation Flow Shop with Total Tardiness Criterion." In Proceedings of the 11th International Conference on Production Research – Americas. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-36121-0_12.

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

Nouha, Nouri, and Ladhari Talel. "A Particle Swarm Optimization Metaheuristic for the Blocking Flow Shop Scheduling Problem: Total Tardiness Minimization." In Multi-Agent Systems and Agreement Technologies. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33509-4_13.

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

Nejjarou, Omar, Said Aqil, and Mohamed Lahby. "Inspired Nature Meta-Heuristics Minimizing Total Tardiness for Manufacturing Flow Shop Scheduling under Setup Time Constraint." In Digital Technologies and Applications. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-29860-8_5.

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

Mascia, Franco, Manuel López-Ibáñez, Jérémie Dubois-Lacoste, and Thomas Stützle. "From Grammars to Parameters: Automatic Iterated Greedy Design for the Permutation Flow-Shop Problem with Weighted Tardiness." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-44973-4_36.

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

Ashwin, S., V. Shankaranarayanan, Damien lamy, S. P. Anbuudayasankar, and M. Thenarasu. "Development and Analysis of Efficient Dispatching Rules for Minimizing Flow Time and Tardiness-Based Performance Measures in a Job Shop Scheduling." In Intelligent Manufacturing and Energy Sustainability. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-6482-3_34.

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

Janiak, A., and M. Lichtenstein. "Comparison of Some Heuristic Algorithms for the Flow Shop Problem with Parallel Machines to Minimize the Total Earliness, Tardiness and Waiting Time." In Operations Research Proceedings 2000. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-56656-1_60.

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

Kumar, Harendra. "Computational Intelligence Approach for Flow Shop Scheduling Problem." In Handbook of Research on Emergent Applications of Optimization Algorithms. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2990-3.ch013.

Full text
Abstract:
Flow shop scheduling is an important tool for manufacturing and engineering, where it can have a major impact on the productivity of a process. Because the resources used in manufacturing activities are very limited, flow shop scheduling becomes a very important concept in managerial decision-making. It deals with the allocation of resources to tasks over given time periods with a view to optimize one or more objective functions like makespan or mean tardiness resulting in reduced production time and costs. During recent years, effective computational intelligent algorithms are developed and s
APA, Harvard, Vancouver, ISO, and other styles
10

Bouzidi, Dalel. "A Variable Neighborhood Search Algorithm to Solve the Flow Shop-Scheduling Problem Through Blocking." In Transportation, Logistics, and Supply Chain Management in Home Healthcare. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-0268-6.ch004.

Full text
Abstract:
In this chapter, we deal with the flow shop-scheduling problem through blocking known to be difficult, where there is no space and a task remains blocked on a machine until the next machine is available. For this reason, we propose the heuristic approach to minimize the delay (tardiness) as an optimization criterion. This chapter proposes a VNS-based heuristic the solutions of which are compared to those of the metaheuristic Greedy Randomized Adaptive Search Procedure (GRASP). We have developed a heuristic-based VNS to get better solutions in a reasonable time. Finally, comparisons with optima
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Generalized tardiness flow shop"

1

Li sufen, Zhu yunlong, and Li xiaoying. "Earliness/tardiness flow-shop scheduling under uncertainty." In 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05). IEEE, 2005. http://dx.doi.org/10.1109/ictai.2005.62.

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

Miretskiy, Igor Yu, Michail M. Guzev, and Pavel V. Popov. "Minimization of Penalties for Tardiness in a Flow Shop Systems." In 2020 2nd International Conference on Control Systems, Mathematical Modeling, Automation and Energy Efficiency (SUMMA). IEEE, 2020. http://dx.doi.org/10.1109/summa50634.2020.9280812.

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

Zhonghua, Han, Shi Haibo, and Liu Chang. "Differential Evolution Algorithm for the Earliness/Tardiness Hybrid Flow-shop Scheduling Problem." In 2009 Third International Symposium on Intelligent Information Technology Application. IEEE, 2009. http://dx.doi.org/10.1109/iita.2009.147.

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

Xiaoli Ding, Chang Liu, Jun Zhu, and Dong Li. "Lagrangian relaxation algorithms for hybrid flow-shop with earliness/tardiness scheduling problems." In 2014 11th World Congress on Intelligent Control and Automation (WCICA). IEEE, 2014. http://dx.doi.org/10.1109/wcica.2014.7052900.

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

Davendra, Donald, Frank Hermann, and Magdalena Bialic-Davendra. "Scheduling Tardiness Constrained Flow Shop with Simultaneously Loaded Stations Using Genetic Algorithm." In ISMSI '20: 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence. ACM, 2020. http://dx.doi.org/10.1145/3396474.3396475.

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

Touil, Achraf, and Abdelwahed Echchatbi. "Fuzzy Rough Total Weighted Tardiness Flow Shop Scheduling Model with Hurwicz Criterion." In 2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2020. http://dx.doi.org/10.1109/fuzz48607.2020.9177752.

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

Yu, Aiqing, and Xingsheng Gu. "Application of Cultural Algorithms to Earliness/Tardiness Flow Shop With Uncertain Processing Time." In Third International Conference on Natural Computation (ICNC 2007). IEEE, 2007. http://dx.doi.org/10.1109/icnc.2007.249.

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

Lai, Peng-Jen, and Ming-Hung Shu. "Tardiness in Fuzzy Flow Shop Scheduling Problems Based on Possibility and Necessity Measures." In 2008 Eighth International Conference on Intelligent Systems Design and Applications (ISDA). IEEE, 2008. http://dx.doi.org/10.1109/isda.2008.218.

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

Zhenhao Xu and Xingsheng Gu. "An Approach for Earliness and Tardiness Scheduling Problems of Flow Shop with Uncertainty." In 2006 6th World Congress on Intelligent Control and Automation. IEEE, 2006. http://dx.doi.org/10.1109/wcica.2006.1714507.

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

Fallah, Mohammad, Sara Benvidi, Reza Tavakkoli-Moghaddam, and Behdin Vahedi-Nouri. "Energy-Aware Permutation Flow Shop Scheduling Problem Considering the Inventory, Tardiness and Energy Costs." In 2019 International Conference on Industrial Engineering and Systems Management (IESM). IEEE, 2019. http://dx.doi.org/10.1109/iesm45758.2019.8948070.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Generalized tardiness flow shop' for particular 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