Minimizing the Number of Tardy Jobs on a Two-Stage Assembly Flowshop__臺灣人文及社會科學引文索引資料庫

:::

詳目顯示

第 1 筆 / 總合 1 筆

/1頁

來源文獻資料
外文摘要
引文資料

題名：	Minimizing the Number of Tardy Jobs on a Two-Stage Assembly Flowshop
書刊名：	工業工程學刊
作者：	Allahverdi, Ali／Aydilek, Asiye／Aydilek, Harun
出版日期：	2016
卷期：	33:6
頁次：	頁391-403
主題關鍵詞：	Scheduling；Assembly flowshop；Number of tardy jobs；Heuristic
原始連結：	連回原系統網址
相關次數：	被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0) 排除自我引用:0 共同引用:2 點閱:23

The objective of minimizing the number of tardy jobs is important as it is directly related to the percentage of on-time shipments, which is often used to rate managers’ performance in many manufacturing environments. To the best of our knowledge, the assembly flowshop scheduling problem with this objective has not been addressed so far, and thus is addressed in this paper. Given that the problem is NP-hard, different heuristics are proposed for the problem in this paper. The proposed heuristics are genetic algorithm (GA), improved genetic algorithm (IGA), simulated annealing algorithm with three different neighborhood structures (SA-1, SA-2, SA-3), Dhouib et al.’s simulated annealing algorithm (DSA), and an improved cloud theory-based simulated annealing algorithm (CSA). The heuristics are evaluated based on extensive computational experiments and all the heuristics were run for the same computational time for a fair comparison. The experiments reveal that the overall average errors of DSA, GA, IGA, CSA, SA-1, SA-2, SA-3 were 20.53, 13.49, 11.64, 3.27, 2.81, 1.92, and 0.56, respectively. Therefore, the proposed heuristic of SA-3 reduces the error of DSA, GA, IGA, CSA, SA-1, SA-2 by about 97, 96, 95, 83, 80, and 71%, respectively. All the results are statistically confirmed.

以文找文

期刊論文
1.	Allahverdi, A.、Gupta, J. N. D.、Aldowiasan, T.(1999)。A Review of Scheduling Research Involving Setup Considerations。Omega: The International Journal of Management Science，27，219-239。
2.	Allahverdi, A.、Al-Anzi, F. S.(2006)。A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed data application。Computers & Operations Research，33，1056-1080。
3.	Moore, J. M.(1968)。An n Job, one machine sequencing algorithm for minimizing the number of late jobs。Management Science，15，102-109。
4.	Lenstra, J. K.、Rinnooy Kan, A. H. G.、Brucker, P.(1977)。Complexity of machine scheduling problems。Annals of Discrete Mathematics，1，343-362。
5.	Al-Anzi, Fawaz S.、Allahverdi, Ali(20060700)。A Hybrid Tabu Search Heuristic for the Two-Stage Assembly Scheduling Problem。International Journal of Operations Research，3(2)，109-119。
6.	Allahverdi, Ali、Al-Anzi, Fawaz S.(2006)。Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times。International Journal of Production Research，44，4713-4735。
7.	Allahverdi, Ali、Al-Anzi, Fawaz S.(2008)。The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time。International Journal of Advanced Manufacturing Technology，37(1/2)，166-177。
8.	Allahverdi, Ali、Al-Anzi, Fawaz S.(2009)。The two-stage assembly scheduling problem to minimize total completion time with setup times。Computers & Operations Research，36，2740-2747。
9.	Haouari, M.、Daouas, T.(1999)。Optimal scheduling of the 3-machine assembly-type flow shop。RAIRO--Operations Research，33，439-445。
10.	Hariri, A. M. A.、Potts, C. N.(1997)。A branch and bound algorithm for the two-stage assembly scheduling problem。European Journal of Operational Research，103，547-556。
11.	Potts, C. N.、Sevast'janov, S. V.、Strusevich, V. A.、Van Wassenhove, L. N.、Zwaneveld, C. M.(1995)。The two-stage assembly scheduling problem: Complexity and approximation。Operations Research，43，346-355。
12.	Sun, X.、Morizawa, K.、Nagasawa, H.(2003)。Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling。European Journal of Operational Research，146，498-516。
13.	Torabzadeh, E.、Zandieh, M.(2010)。Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop。Advances in Engineering Software，41，1238-1243。
14.	Tozkapan, A.、Kirca, Ö.、Chung, C. S.(2003)。A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem。Computers & Operations Research，30，309-320。
15.	Allahverdi, A.、Ng, C. T.、Cheng, T. C. E.、Kovalyov, M. Y.(2008)。A survey of scheduling problems with setup times or costs。European Journal of Operational Research，187，985-1032。
16.	Lee, C. Y.、Cheng, T. C. E.、Lin, B. M. T.(1993)。Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem。Management Science，39，616-625。
17.	Hall, N. G.、Posner, M. E.(2001)。Generating experimental data for computational testing with machine scheduling applications。Operations Research，49，854-865。
18.	Vinod, V.、Sridharan, R.(2009)。Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times。International Journal of Production Research，47，1425-1447。
19.	Ruiz, R.、Maroto, C.、Alcaraz, J.(2006)。Two new robust genetic algorithms for the flowshop scheduling problem。Omega，34(5)，461-476。
20.	Bean, J. C.(1994)。Genetic algorithms and random keys for sequencing and optimization。ORSA Journal on Computing，6(2)，154-160。
21.	Seo, D. K.、Klein, C. M.、Jang, W.(2005)。Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models。Computers & Industrial Engineering，48，153-161。
22.	Al-Anzi, F. S.、Allahverdi, A.(2007)。A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times。European Journal of Operational Research，182，80-94。
23.	Aldowaisan, T.、Allahverdi, A.(2012)。No-wait flowshop scheduling problem to minimize the number of tardy jobs。The International Journal of Advanced Manufacturing Technology，61，311-323。
24.	Allahverdi, A.(2015)。The third comprehensive survey on scheduling problems with setup times/costs。European Journal of Operational Research，246(2)，345-378。
25.	Allahverdi, A.、Aydilek, H.(2015)。The two stage assembly flowshop scheduling problem to minimize total tardiness。Journal of Intelligent Manufacturing，26，225-237。
26.	Chang, P. C.、Chen, S. H.、Fan, C. Y.、Chan, C. L.(2008)。Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems。Applied Mathematics and Computation，205，550-561。
27.	Choi, H.-S.、Lee, D.-H.(2009)。Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops。Computers and Industrial Engineering，56，113-120。
28.	Crocea, F. D.、Gupta, J. N. D.、Tadei, R.(2000)。Minimizing tardy jobs in a flowshop with common due date。European Journal of Operational Research，120，375-381。
29.	Dhouib, E.、Teghem, J.、Loukil, T.(2013)。Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints。Journal of Mathematical Modeling Algorithms，12，85-99。
30.	Jolai, F.、Rabbani, M.、Amalnick, S.、Dabaghi, A.、Dehghan, M.、Parast, M.(2007)。Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs。Applied Mathematics and Computation，194，552-560。
31.	Naderi, B.、Khalili, M.、Taghavifard, M. T.、Roshanaei, V.(2008)。A variable neighborhood search for hybrid flexible flowshops with setup times minimizing total completion time。Journal of Applied Sciences，8，2843-2850。
32.	Onwubolu, G.、Mutingi, M.(1999)。Genetic algorithm for minimizing tardiness in flow-shop scheduling。Production Planning & Control，10，462-471。
33.	Rajkumar, R.、Shahabudeen, P.(2009)。An improved genetic algorithm for the flowshop scheduling problem。International Journal of Production Research，47，233-249。
34.	Soroush, H. M.(2012)。Solving the single machine scheduling problem with general job-dependent past-sequence-dependent setup times and learning effects。European Journal of Industrial Engineering，6，596-628。
35.	Ulusam Seckiner, S.、Kurt, M.(2007)。A simulated annealing approach to the solution of job rotation scheduling problems。Applied Mathematics and Computation，188，31-45。
36.	Vallada, E.、Ruiz, R.(2009)。Cooperative metaheuristics for the permutation flowshop scheduling problem。European Journal of Operational Research，193，365-376。
37.	Vallada, E.、Ruiz, R.(2010)。Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem。OMEGA International Journal of Management Science，38，57-67。
38.	Xiao, Y. Y.、Zhang, R. Q.、Zhao, Q. H.、Kaku, I.(2012)。Permutation flow shop scheduling with order acceptance and weighted tardiness。Applied Mathematics and Computation，218，7911-7926。
39.	Hariri, A. M. A.、Gupta, J. N. D.(1997)。Two-Machine Flowshop Scheduling to Minimize the Number of Tardy Jobs。Journal of the Operational Research Society，48(2)，212-220。
40.	Koulamas, C.(1998)。On the complexity of two-machine flowshop problems with due date related objectives。European Journal of Operational Research，106，95-100。

推文
推薦
引用網址
引用嵌入語法
轉寄

top

:::

相關期刊
相關論文
相關專書
相關著作
熱門點閱

1.	Lot Streaming in a Two-Stage Assembly Hybrid Flow Shop Scheduling Problem with a Work Shift Constraint
2.	Better Heuristics for a Two-Stage Multi-Machine Assembly Scheduling Problem to Minimize Total Completion Time
3.	A Hybrid Tabu Search Heuristic for the Two-Stage Assembly Scheduling Problem

無相關博士論文

無相關書籍

無相關著作

1.	A Branch-and-Bound Algorithm for Identical Parallel Machine Total Tardiness Scheduling Problem with preemption
2.	Bi-Objective Optimization for Integrating Production and Preventive Maintenance Scheduling in Two-Stage Assembly Flow Shop Problem
3.	A Branch-and-Bound Algorithm for Identical Parallel-Machine Total Completion Time Scheduling Problem with Preemption and Release Times
4.	An Exploration on Debugging Performance for Software Reliability Growth Models with Learning Effects and Change-Points
5.	A Study on Nurse Day-Off Scheduling under the Consideration of Binary Preference
6.	A Production Inventory Model for Vendor–Buyer Coordination with Quantity Discount, Backordering and Rework for Fixed Life Time Products
7.	Measuring Schedule Uncertainty for a Stochastic Resource-Constrained Project Using Scenario-Based Approach with Utility-Entropy Decision Model
8.	A Rostering Optimization Model for Physician Scheduling in Medical Department--A Case Study in District Hospital
9.	Interpretive Structural Modeling and Path Analysis for Proposed Framework of Lean Supply Chain in Indian Manufacturing Industry
10.	Modified Single-Vendor Single-Buyer Supply Chain Model with Quality Loss for Product
11.	On Two-door Three-dimensional Container Packing Problem under Home Delivery Service
12.	A Computational Analysis of the Impact of Correlation and Data Translation on DEA Efficiency Scores
13.	Slide Operation Method for a Touch Screen--The Concept of Connecting Audio Component
14.	Bi-objective Closed-loop Supply Chain Network Design with Risks in a Fuzzy Environment

QR Code

臺灣人文及社會科學引文索引資料庫系統

詳目顯示

臺灣人文及社會科學引文索引資料庫