Gotowe bibliografie tematyczne / Generalized tardiness flow shop / Artykuły w czasopismach
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Generalized tardiness flow shop.

Artykuły w czasopismach na temat „Generalized tardiness flow shop”

Autor: Grafiati
Data publikacji: 3 czerwca 2025
Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Generalized tardiness flow shop”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

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.

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Streszczenie:
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
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Streszczenie:
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
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Streszczenie:
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
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Streszczenie:
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
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Streszczenie:
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
Style APA, Harvard, Vancouver, ISO itp.
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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
11

Chandra, Pankaj, Peeyush Mehta, and Devanath Tirupati. "Permutation flow shop scheduling with earliness and tardiness penalties." International Journal of Production Research 47, no. 20 (2009): 5591–610. http://dx.doi.org/10.1080/00207540802124301.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
12

Zhao, Fu Qing, and Ning Li. "Flow Time and Tardiness Based on New Scheduling Rules for Dynamic Shop Scheduling with Machine Breakdown." Applied Mechanics and Materials 556-562 (May 2014): 4412–16. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.4412.

Pełny tekst źródła
Streszczenie:
In this paper, a comparative study on the performance of scheduling rules in job shop. Four new dispatching rules are proposed. mean, maximum ,variance of tardiness and proportion of tardy jobs have been used to evaluate the performance of various scheduling rules. Breakdown level, shop load level was considered in the comparative study. The simulation result indicate the performance of dispatching rules is being influenced by Breakdown level, shop load level.
Style APA, Harvard, Vancouver, ISO itp.
13

Bang Do-Ly, Linh Nguyen-Thuy, Thang Nguyen-Quoc, Uyen Phung-Duy, and Ngoc-Hien Do. "Job shop scheduling with combinatorial priority rules in a furniture company." World Journal of Advanced Engineering Technology and Sciences 10, no. 2 (2023): 213–22. http://dx.doi.org/10.30574/wjaets.2023.10.2.0312.

Pełny tekst źródła
Streszczenie:
This paper analyzed a job shop scheduling problem with combinatorial priority rule from a case study of a furniture company, whose product – cupboard – has the highest volume and revenue while it is struggling with tardiness at about 10%. The goal of this scheduling is to minimize the mean flow time, mean tardiness time and the proportion of tardy jobs and compare its performance to one traditional priority rule – Longest Processing Time first. As results, the combinatorial priority rules in scheduling would bring a positive outcome with reducing mean flow time and around 3.45% for proportion
Style APA, Harvard, Vancouver, ISO itp.
14

Prathipati, Nikhil, K.N.Phanindra, Chalapathi P.Venkata, Ikram Mohammed, and B.Akhil. "Flexible Job Shop Scheduling using Software." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 3 (2020): 67–70. https://doi.org/10.35940/ijeat.B3430.029320.

Pełny tekst źródła
Streszczenie:
This present paper speaks about Flexible Job Shop scheduling Problem using a software. Flexible Job shop scheduling is most typical and complex manufacturing environments in production planning issues. A case study was conducted on a manufacturing business set in Vijayawada. Information collected from the producing company to get the time taken by the conventional scheduling method and gathered data for 5 jobs requiring 8 machines that arrived during the analysis period. The Project additionally speaks about the study of varied programming strategies, learning of LEKIN programming package is a
Style APA, Harvard, Vancouver, ISO itp.
15

Karacan, Ismet, Ozlem Senvar, and Serol Bulkan. "A Novel Parallel Simulated Annealing Methodology to Solve the No-Wait Flow Shop Scheduling Problem with Earliness and Tardiness Objectives." Processes 11, no. 2 (2023): 454. http://dx.doi.org/10.3390/pr11020454.

Pełny tekst źródła
Streszczenie:
In this paper, the no-wait flow shop problem with earliness and tardiness objectives is considered. The problem is proven to be NP-hard. Recent no-wait flow shop problem studies focused on familiar objectives, such as makespan, total flow time, and total completion time. However, the problem has limited studies with solution approaches covering the concomitant use of earliness and tardiness objectives. A novel methodology for the parallel simulated annealing algorithm is proposed to solve this problem in order to overcome the runtime drawback of classical simulated annealing and enhance its ro
Style APA, Harvard, Vancouver, ISO itp.
16

Kapoor, Eirtty, Ashish Kumar, and Devendra Singh. "Energy-Efficient Flexible Flow Shop Scheduling With Due Date and Total Flow Time." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 2s (2023): 259–67. http://dx.doi.org/10.17762/ijritcc.v11i2s.6145.

Pełny tekst źródła
Streszczenie:
One of the most significant optimization issues facing a manufacturing company is the flexible flow shop scheduling problem (FFSS). However, FFSS with uncertainty and energy-related elements has received little investigation. Additionally, in order to reduce overall waiting times and earliness/tardiness issues, the topic of flexible flow shop scheduling with shared due dates is researched. Using transmission line loadings and bus voltage magnitude variations, an unique severity function is formulated in this research. Optimize total energy consumption, total agreement index, and make span all
Style APA, Harvard, Vancouver, ISO itp.
17

Manoharan, Chandrasekaran. "AIS-SFHM APPROACH FOR OPTIMIZATION OF MULTI OBJECTIVE JOB SHOP PROBLEMS." JOURNAL OF ADVANCES IN CHEMISTRY 13, no. 7 (2017): 6363–68. http://dx.doi.org/10.24297/jac.v13i7.5633.

Pełny tekst źródła
Streszczenie:
The n-job, m-machine Job shop scheduling (JSP) problem is one of the general production scheduling problems. The JSP problem is a scheduling problem, where a set of ‘n’ jobs must be processed or assembled on a set of ‘m’ dedicated machines. Each job consists of a specific set of operations, which have to be processed according to a given technical precedence order. Job shop scheduling problem is a NP-hard combinatorial optimization problem.  In this paper, optimization of three practical performance measures mean job flow time, mean job tardiness and makespan are considered. The hybri
Style APA, Harvard, Vancouver, ISO itp.
18

Kaweegitbundit, Parinya. "Evaluation Dispatching Rules for Two-Stage Hybrid Flow Shop Scheduling with Parallel Machines." Applied Mechanics and Materials 152-154 (January 2012): 1487–91. http://dx.doi.org/10.4028/www.scientific.net/amm.152-154.1487.

Pełny tekst źródła
Streszczenie:
This paper considers two stage hybrid flow shop with identical parallel machine and evaluate performance of common dispatching rules; shortage processing time (SPT) longest processing time (LPT) earliness due date (EDD) and first in first out (FIFO). The objectives are to determine makespan and total tardiness have been minimized. To evaluated performance of dispatching rules, the results have been compared on each criterion. The experimental results show that SPT outperform than other rules with minimizes makespan as an objective function for all problems. On the other hand, for minimize tota
Style APA, Harvard, Vancouver, ISO itp.
19

Engin, Orhan, and Batuhan Engin. "Hybrid flow shop with multiprocessor task scheduling based on earliness and tardiness penalties." Journal of Enterprise Information Management 31, no. 6 (2018): 925–36. http://dx.doi.org/10.1108/jeim-04-2017-0051.

Pełny tekst źródła
Streszczenie:
Purpose Hybrid flow shop with multiprocessor task (HFSMT) has received considerable attention in recent years. The purpose of this paper is to consider an HFSMT scheduling under the environment of a common time window. The window size and location are considered to be given parameters. The research deals with the criterion of total penalty cost minimization incurred by earliness and tardiness of jobs. In this research, a new memetic algorithm in which a global search algorithm is accompanied with the local search mechanism is developed to solve the HFSMT with jobs having a common time window.
Style APA, Harvard, Vancouver, ISO itp.
20

Ouchiekh, R., M. Fri, A. Touil, and A. Echchatbi. "Total Weighted Tardiness in the Permutation Flow Shop under Uncertainty." IFAC-PapersOnLine 54, no. 1 (2021): 1174–80. http://dx.doi.org/10.1016/j.ifacol.2021.08.138.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
21

Xiao, Yi-Yong, Ren-Qian Zhang, Qiu-Hong Zhao, and Ikou Kaku. "Permutation flow shop scheduling with order acceptance and weighted tardiness." Applied Mathematics and Computation 218, no. 15 (2012): 7911–26. http://dx.doi.org/10.1016/j.amc.2012.01.073.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
22

Schaller, Jeffrey, and Jorge M. S. Valente. "Minimizing total earliness and tardiness in a nowait flow shop." International Journal of Production Economics 224 (June 2020): 107542. http://dx.doi.org/10.1016/j.ijpe.2019.107542.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
23

Lakshmipathy, D., M. Chandrasekaran, T. Balamurugan, and P. Sriramya. "A New GT Heuristic for Solving Multi Objective Job Shop Scheduling Problems." Applied Mechanics and Materials 591 (July 2014): 184–88. http://dx.doi.org/10.4028/www.scientific.net/amm.591.184.

Pełny tekst źródła
Streszczenie:
The n-job, m-machine Job shop scheduling (JSP) problem is one of the general production scheduling problems in manufacturing system. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems. Scheduling problems are usually solved using heuristics to get optimal or near optimal solutions because problems found in practical applications cannot be solved to optimality using reasonable resources in many cases. In this paper, optimization of three practical performance measures mean job flow time, mean job tardiness and makespan are considered. New Game t
Style APA, Harvard, Vancouver, ISO itp.
24

Li, Shi-Sheng, De-Liang Qian, and Ren-Xia Chen. "Proportionate Flow Shop Scheduling with Rejection." Asia-Pacific Journal of Operational Research 34, no. 04 (2017): 1750015. http://dx.doi.org/10.1142/s0217595917500154.

Pełny tekst źródła
Streszczenie:
We consider the problem of scheduling [Formula: see text] jobs with rejection on a set of [Formula: see text] machines in a proportionate flow shop system where the job processing times are machine-independent. The goal is to find a schedule to minimize the scheduling cost of all accepted jobs plus the total penalty of all rejected jobs. Two variations of the scheduling cost are considered. The first is the maximum tardiness and the second is the total weighted completion time. For the first problem, we first show that it is [Formula: see text]-hard, then we construct a pseudo-polynomial time
Style APA, Harvard, Vancouver, ISO itp.
25

Huang, Rong-Hwa, and Shun-Chi Yu. "Clarifying Cutting and Sewing Processes with Due Windows Using an Effective Ant Colony Optimization." Mathematical Problems in Engineering 2013 (2013): 1–12. http://dx.doi.org/10.1155/2013/182598.

Pełny tekst źródła
Streszczenie:
The cutting and sewing process is a traditional flow shop scheduling problem in the real world. This two-stage flexible flow shop is often commonly associated with manufacturing in the fashion and textiles industry. Many investigations have demonstrated that the ant colony optimization (ACO) algorithm is effective and efficient for solving scheduling problems. This work applies a novel effective ant colony optimization (EACO) algorithm to solve two-stage flexible flow shop scheduling problems and thereby minimize earliness, tardiness, and makespan. Computational results reveal that for both sm
Style APA, Harvard, Vancouver, ISO itp.
26

Mansouri, Milad, Hacene Smadi, and Younes Bahmani. "Multi-objective optimization in an identical parallel flow shop scheduling problem with waiting time constraint." STUDIES IN ENGINEERING AND EXACT SCIENCES 5, no. 2 (2024): e12011. https://doi.org/10.54021/seesv5n2-752.

Pełny tekst źródła
Streszczenie:
The Operations Research community has grown interested in scheduling problems within flow shop systems. Despite this, the Identical Parallel Flow Shop Scheduling Problem (IPFSSP) remains underexplored, especially with multiple objective functions. This paper aims to bridge this gap by developing a scheduling strategy for an Identical Parallel Flow Shop Scheduling Problem with a bicriteria objective, focusing on Makespan and the total Earliness and Tardiness of jobs while considering Waiting time constraint. The study employs both a priori and a posteriori methods to address the problem. The ma
Style APA, Harvard, Vancouver, ISO itp.
27

Hertrich, Christoph, Christian Weiß, Heiner Ackermann, Sandy Heydrich, and Sven O. Krumke. "Scheduling a proportionate flow shop of batching machines." Journal of Scheduling 23, no. 5 (2020): 575–93. http://dx.doi.org/10.1007/s10951-020-00667-2.

Pełny tekst źródła
Streszczenie:
Abstract In this paper we study a proportionate flow shop of batching machines with release dates and a fixed number $$m \ge 2$$ m ≥ 2 of machines. The scheduling problem has so far barely received any attention in the literature, but recently its importance has increased significantly, due to applications in the industrial scaling of modern bio-medicine production processes. We show that for any fixed number of machines, the makespan and the sum of completion times can be minimized in polynomial time. Furthermore, we show that the obtained algorithm can also be used to minimize the weighted t
Style APA, Harvard, Vancouver, ISO itp.
28

Bank, M., S. M. T. Fatemi Ghomi, F. Jolai, and J. Behnamian. "Two-machine flow shop total tardiness scheduling problem with deteriorating jobs." Applied Mathematical Modelling 36, no. 11 (2012): 5418–26. http://dx.doi.org/10.1016/j.apm.2011.12.010.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
29

Xiao, Yiyong, Yingying Yuan, Ren-Qian Zhang, and Abdullah Konak. "Non-permutation flow shop scheduling with order acceptance and weighted tardiness." Applied Mathematics and Computation 270 (November 2015): 312–33. http://dx.doi.org/10.1016/j.amc.2015.08.011.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
30

Bülbül, Kerem, Philip Kaminsky, and Candace Yano. "Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs." Naval Research Logistics (NRL) 51, no. 3 (2004): 407–45. http://dx.doi.org/10.1002/nav.20000.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
31

Brahma, Datta Shukla *. &. Pragya Singh Tomar. "OPTIMIZATION OF FLOW SHOP SCHEDULING USING MATLAB." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 7, no. 9 (2018): 323–29. https://doi.org/10.5281/zenodo.5150000.

Pełny tekst źródła
Streszczenie:
In a manufacturing industries, scheduling process in production plays a vital role in different aspects like in reducing the cost of product, productivity to be increased, satisfaction of customer and competition in the market. Proper scheduling provides and leads to proper utilization of parameters like available goods, manpower, machinery and sufficiently reaches the satisfaction of customer and also demand of product. There are different systems of production scheduling process includes flow shop where the jobs are processed through series of machines to reach the final product. To deliver
Style APA, Harvard, Vancouver, ISO itp.
32

Huang, Rong Hwa, Tung Han Yu, and Chang Lin Yang. "Multiprocessor Flow Shop Scheduling Problem with Common due Window." Applied Mechanics and Materials 284-287 (January 2013): 3712–16. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.3712.

Pełny tekst źródła
Streszczenie:
The objective of scheduling is to maximize capacity utilization, minimize work-in-process inventory and ensure timely delivery. The due windows problem proposes that jobs should only be finished within the time interval that meets customer needs. This research applies integer programming (IP) and ant colony optimization (ACO) to solve due window problems in a flow shop with multiprocessors (FSMP). To improve the performance of jobs within due windows, this research splits them into different numbers of processing lots so they can be processed on more than one machine simultaneously. This short
Style APA, Harvard, Vancouver, ISO itp.
33

Peng, Chen, Tao Peng, Yi Zhang, Renzhong Tang, and Luoke Hu. "Minimising Non-Processing Energy Consumption and Tardiness Fines in a Mixed-Flow Shop." Energies 11, no. 12 (2018): 3382. http://dx.doi.org/10.3390/en11123382.

Pełny tekst źródła
Streszczenie:
To meet the increasingly diversified demand of customers, more mixed-flow shops are employed. The flexibility of mixed-flow shops increases the difficulty of scheduling. In this paper, a mixed-flow shop scheduling approach (MFSS) is proposed to minimise the energy consumption and tardiness fine (TF) of production with a special focus on non-processing energy (NPE) reduction. The proposed approach consists of two parts: firstly, a mathematic model is developed to describe how NPE and TF can be determined with a specific schedule; then, a multi-objective evolutionary algorithm with multi-chromos
Style APA, Harvard, Vancouver, ISO itp.
34

Kurniawati, Dwi Agustina, and Yoga Isnaini Nugroho. "Computational Study of N-Job M-Machine Flow Shop Scheduling Problems: SPT, EDD, NEH, NEH-EDD, and Modified-NEH Algorithms." Journal of Advanced Manufacturing Systems 16, no. 04 (2017): 375–84. http://dx.doi.org/10.1142/s0219686717500226.

Pełny tekst źródła
Streszczenie:
This paper discusses about the flow shop scheduling problems using shortest processing time, earliest due date (EDD), Nawaz, Enscore, and Ham (NEH), NEH-EDD, and modified-NEH methods. The objective of this research is to determine the performance of these methods in minimizing makespan and total tardiness. Processing times and due dates were randomly generated, and computational studies were performed in Microsoft Visual Basic 6.0. The experiments are performed for small and medium data sets. Efficiency index, relative error, and run time measure the performance of each method. Experimental re
Style APA, Harvard, Vancouver, ISO itp.
35

Lee, Wen-Chiung, and Chin-Chia Wu. "Minimizing the total flow time and the tardiness in a two-machine flow shop." International Journal of Systems Science 32, no. 3 (2001): 365–73. http://dx.doi.org/10.1080/002077201300029746.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
36

Gopinath, S., C. Arumugam, Tom Page, and M. Chandrasekaran. "Solving Multi Objective Job Shop Scheduling Problems Using Artificial Immune System Shifting Bottleneck Approach." Applied Mechanics and Materials 766-767 (June 2015): 1209–13. http://dx.doi.org/10.4028/www.scientific.net/amm.766-767.1209.

Pełny tekst źródła
Streszczenie:
Scheduling problems are usually solved using heuristics to get optimal or near optimal solutions because problems found in practical applications cannot be solved to optimality using reasonable resources in many cases. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems. Optimization of three practical performance measures mean job flow time, mean job tardiness and makespan are considered in this work. The Artificial Immune System Shifting Bottleneck Approach is used for finding optimal makespan, mean flow time, mean tardiness values of two benc
Style APA, Harvard, Vancouver, ISO itp.
37

Witkowski, T., P. Antczak, and A. Antczak. "Multi-objective decision making and search space for the evaluation of production process scheduling." Bulletin of the Polish Academy of Sciences: Technical Sciences 57, no. 3 (2009): 195–208. http://dx.doi.org/10.2478/v10175-010-0121-4.

Pełny tekst źródła
Streszczenie:
Multi-objective decision making and search space for the evaluation of production process schedulingOver the years, various approaches have been proposed in order to solve the multi-objective job-shop scheduling problem - particularly a hard combinatorial optimization problem. The paper presents an evaluation of job shop scheduling problem under multiple objectives (mean flow time, max lateness, mean tardiness, mean weighted tardiness, mean earliness, mean weighted earliness, number of tardy tasks). The formulation of the scheduling problem has been presented as well as the evaluation schedule
Style APA, Harvard, Vancouver, ISO itp.
38

Sharma, Pankaj, and Ajai Jain. "Effect of routing flexibility and sequencing rules on performance of stochastic flexible job shop manufacturing system with setup times: Simulation approach." Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture 231, no. 2 (2016): 329–45. http://dx.doi.org/10.1177/0954405415576060.

Pełny tekst źródła
Streszczenie:
Routing flexibility is a major contributor towards flexibility of a flexible job shop manufacturing system. This article focuses on a simulation-based experimental study on the effect of routing flexibility and sequencing rules on the performance of a stochastic flexible job shop manufacturing system with sequence-dependent setup times while considering dynamic arrival of job types. Six route flexibility levels and six sequencing rules are considered for detailed study. The performance of manufacturing system is evaluated in terms of flow time related and due date–related measures. Results rev
Style APA, Harvard, Vancouver, ISO itp.
39

Sonata, Fifin, and Dede Prabowo Wiguna. "Analisis Perbandingan Aggregat Of Function (AOF) dengan Non-Dominated Sorting Genetic Algorithm (NSGA-II) dalam Menentukan Optimasi Multi-Objective pada Penjadwalan Mesin Produksi Flow Shop." Jurnal SAINTIKOM (Jurnal Sains Manajemen Informatika dan Komputer) 17, no. 2 (2018): 158. http://dx.doi.org/10.53513/jis.v17i2.39.

Pełny tekst źródła
Streszczenie:
Penjadwalan mesin produksi dalam dunia industri memiliki peranan penting sebagai bentuk pengambilan keputusan. Salah satu jenis sistem penjadwalan mesin produksi adalah sistem penjadwalan mesin produksi tipe flow shop. Dalam penjadwalan flow shop, terdapat sejumlah pekerjaan (job) yang tiap-tiap job memiliki urutan pekerjaan mesin yang sama. Optimasi penjadwalan mesin produksi flow shop berkaitan dengan penyusunan penjadwalan mesin yang mempertimbangkan 2 objek yaitu makespan dan total tardiness. Optimasi kedua permasalahan tersebut merupakan optimasi yang bertolak belakang sehingga diperlukan
Style APA, Harvard, Vancouver, ISO itp.
40

Phanden, Rakesh Kumar, Ajai Jain, and Rajiv Verma. "A Genetic Algorithm-Based Approach for Flexible Job Shop Scheduling." Applied Mechanics and Materials 110-116 (October 2011): 3930–37. http://dx.doi.org/10.4028/www.scientific.net/amm.110-116.3930.

Pełny tekst źródła
Streszczenie:
Flexible job shop scheduling is a hard combinatorial optimization problem. This paper introduces a simulation-based Genetic Algorithm approach to solve flexible job shop scheduling problem. Four manufacturing scenarios have been considered to access the performance of a job shop with objective to minimize mean tardiness, mean flow time and makespan. Results show that multiple process plans performs better than single process plan for each job type and if only single process plan is made available, then process plan selected on the basis of minimum production time criterion yields better result
Style APA, Harvard, Vancouver, ISO itp.
41

Paprocka, Iwona, Wojciech M. Kempa, Krzysztof Kalinowski, and Cezary Grabowik. "On Pareto Optimal Solution for Production and Maintenance Jobs Scheduling Problem in a Job Shop and Flow Shop with an Immune Algorithm." Advanced Materials Research 1036 (October 2014): 875–80. http://dx.doi.org/10.4028/www.scientific.net/amr.1036.875.

Pełny tekst źródła
Streszczenie:
In the paper a job shop and flow shop scheduling problems with availability time constraint for maintenance are considered. Unavailability time due to maintenance is estimated basing on information about predicted Mean Time To Failure/To First Failure and Mean Time of Repair of a machine. Maintenance actions are introduced into a schedule to keep the machine available in a good operation condition. The efficiency of predictive schedules (PS) is evaluated using criteria: makespan, flow time, total tardiness, idle time. The efficiency of reactive schedules (RSs) is evaluated using criteria: solu
Style APA, Harvard, Vancouver, ISO itp.
42

K.T., Vinod, S. Prabagaran, and O. A. Joseph. "Dynamic due date assignment method." Journal of Manufacturing Technology Management 30, no. 6 (2019): 987–1003. http://dx.doi.org/10.1108/jmtm-06-2017-0112.

Pełny tekst źródła
Streszczenie:
Purpose The purpose of this paper is to determine the interaction between dynamic due date assignment methods and scheduling decision rules in a typical dynamic job shop production system in which setup times are sequence dependent. Two due date assignment methods and six scheduling rules are considered for detailed investigation. The scheduling rules include two new rules which are modifications of the existing rules. The performance of the job shop system is evaluated using various measures related to flow time and tardiness. Design/methodology/approach A discrete-event simulation model is d
Style APA, Harvard, Vancouver, ISO itp.
43

Schaller, Jeffrey. "Scheduling a permutation flow shop with family setups to minimise total tardiness." International Journal of Production Research 50, no. 8 (2012): 2204–17. http://dx.doi.org/10.1080/00207543.2011.575094.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
44

Chen *, J. S., and J. C. H. Pan. "Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling." International Journal of Systems Science 36, no. 12 (2005): 757–66. http://dx.doi.org/10.1080/00207720500219237.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
45

Nagano, Marcelo Seido, Adriano Seiko Komesu, and Hugo Hissashi Miyata. "An evolutionary clustering search for the total tardiness blocking flow shop problem." Journal of Intelligent Manufacturing 30, no. 4 (2017): 1843–57. http://dx.doi.org/10.1007/s10845-017-1358-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
46

Kharbeche, M., and M. Haouari. "MIP models for minimizing total tardiness in a two-machine flow shop." Journal of the Operational Research Society 64, no. 5 (2013): 690–707. http://dx.doi.org/10.1057/jors.2012.89.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
47

Ghassemi Tari, Farhad, and Laya Olfat. "Heuristic rules for tardiness problem in flow shop with intermediate due dates." International Journal of Advanced Manufacturing Technology 71, no. 1-4 (2013): 381–93. http://dx.doi.org/10.1007/s00170-013-5478-8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
48

Lin, Zheng Ying, and Wei Zhang. "Study on Multi-Objective Optimization of Hybrid Flow Shop Scheduling Problem." Advanced Materials Research 1082 (December 2014): 529–34. http://dx.doi.org/10.4028/www.scientific.net/amr.1082.529.

Pełny tekst źródła
Streszczenie:
Due to several mutual conflicting optimized objectives in the hybrid flow shop scheduling problem, its optimized model, including three objectives of make-span, flow-time and tardiness, was firstly set up, instead of the single optimized objective. Furthermore, in order to improve the optimized efficiency and parallelism, after comparing the normal multi-objective optimized methods, an improved NSGA-II algorithm with external archive strategy was proposed. Finally, taking a piston production line as example, its performance was tested. The result showed that the multi-objective optimization of
Style APA, Harvard, Vancouver, ISO itp.
49

Xu, Xiao Qiang, and De Ming Lei. "A Parallel Iterated Local Search for Two-Agent Flow Shop Scheduling." Advanced Materials Research 926-930 (May 2014): 3476–84. http://dx.doi.org/10.4028/www.scientific.net/amr.926-930.3476.

Pełny tekst źródła
Streszczenie:
In this paper a two-agent flow shop scheduling problem is studied and a simple parallel iterated local search algorithm is proposed to minimize the makespan of jobs from the first agent and the total tardiness of jobs from the second agent simultaneously. Parallelization is implemented by applying multiple independent searches, each of which uses three neighborhood structures with dynamical transition mechanism. The current solution of each independent search is replaced with a solution, which is randomly chosen from the non-dominated set and perturbed. The computational experiments show the p
Style APA, Harvard, Vancouver, ISO itp.
50

El Khoukhi, Fatima, Tarik Lamoudan, Jaouad Boukachour, and Ahmed El Hilali Alaoui. "Ant Colony Algorithm for Just-in-Time Job Shop Scheduling with Transportation Times and Multirobots." ISRN Applied Mathematics 2011 (June 22, 2011): 1–19. http://dx.doi.org/10.5402/2011/165620.

Pełny tekst źródła
Streszczenie:
Handling rapidly evolving technology and almost daily changes in demand and customer satisfaction, while maintaining competitiveness in a highly competitive environment, requires good coordination and planning of both production and logistics activities on the shop floor, namely: machines and tools. The goal is to optimize costs and reduce delivery lead times in order to provide the customer just in time; we focus on the job shop scheduling problem (JSSP), which is one of the most complex problems encountered in real shop floor. In this paper, we study a generalized (JSSP) including transporta
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii