CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Fuzzy Simulation-based Genetic Algorithm for Just-in-Time Flow Shop Scheduling with Linear Deterioration Function

by Mostafa Jannatipour, Babak Shirazi, Iraj Mahdavi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 57 - Number 16
Year of Publication: 2012
Authors: Mostafa Jannatipour, Babak Shirazi, Iraj Mahdavi
10.5120/9196-3718

Mostafa Jannatipour, Babak Shirazi, Iraj Mahdavi . Fuzzy Simulation-based Genetic Algorithm for Just-in-Time Flow Shop Scheduling with Linear Deterioration Function. International Journal of Computer Applications. 57, 16 ( November 2012), 7-14. DOI=10.5120/9196-3718

@article{ 10.5120/9196-3718,
author = { Mostafa Jannatipour, Babak Shirazi, Iraj Mahdavi },
title = { Fuzzy Simulation-based Genetic Algorithm for Just-in-Time Flow Shop Scheduling with Linear Deterioration Function },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 57 },
number = { 16 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 7-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume57/number16/9196-3718/ },
doi = { 10.5120/9196-3718 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:00:36.896136+05:30
%A Mostafa Jannatipour
%A Babak Shirazi
%A Iraj Mahdavi
%T Fuzzy Simulation-based Genetic Algorithm for Just-in-Time Flow Shop Scheduling with Linear Deterioration Function
%J International Journal of Computer Applications
%@ 0975-8887
%V 57
%N 16
%P 7-14
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In most of the flow shop scheduling problem studies, the processing times of jobs are considered constant and deterministic. These assumptions obviously suggest a significant gap between theory and real-world production problems. In this study, the problem of flow shop scheduling with linear job deterioration is addressed. This problem is investigated in an uncertain environment, and fuzzy theory is applied to describe this situation. The considered objective is minimizing the sum of fuzzy earliness and tardiness penalties. The problem which is known to be NP-hard is compatible with the concepts of just-in-Time (JIT) production. To solve this complex problem, a novel integrating optimization approach based on fuzzy simulation and genetic algorithm is proposed. A set of random test problems with different structures are presented to evaluate the performance of this approach. The computational results demonstrate effectiveness of the proposed approach.

References
  1. Bank, M. , Fatemi-Ghomi, S. M. T. , Jolai, F. , Behnamian, J. , 2012. Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration, Advances in Engineering Software 47:1–6.
  2. Gupta, J. N. D, Gupta, S. K. , 1988. Single facility scheduling with nonlinear processing times, Computers & Industrial Engineering 14: 387–393.
  3. Kononov, A. , Gawiejnowicz, S. , 2001. NP-hard cases in scheduling deteriorating jobs on dedicated machines. Journal of the Operational Research Society 52 (6): 708–717.
  4. Mosheiov, G. , 2002. Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics 117: 195–209.
  5. Wang, J. B. , Xia, Z. Q. , 2006. Flow shop scheduling with deteriorating jobs under dominating machines. Omega, 34, 327–336.
  6. Ng, C. T. , Wang J. B. , Cheng, T. C. E. , Liu, L. L. , 2010. A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Comput Oper Res 37:83–90.
  7. Bank, M. , Fatemi-Ghomi, S. M. T. , Jolai, F. , Behnamian, J. , 2012. Two-machine flow shop total tardiness scheduling problem with deteriorating jobs, Appl. Math. Modell, doi: 10. 1016/j. apm. 2011. 12. 010.
  8. Balin, S. , 2011. Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation, Information Sciences 181:3551–3569.
  9. Anglani, A. , Grieco, A. , Guerriero, E. , Musmanno, R. , 2005. Robust scheduling of parallel machines with sequence-dependent setup costs, European Journal of Operational Research 161:704–720.
  10. Tran, L. , Duzkstein, L. , 2002. Comparison of fuzzy numbers using a fuzzy distance measure, Fuzzy Sets and Systems 130: 331–341.
  11. Ruiz, R. , Stützle, T. , 2008 An iterated greedy heuristic for the sequence dependent setup times flow shop problem with makespan and weighted tardiness objectives. European Journal of Operational Research 187(3): 1143–59.
  12. Fortemps, P. , Roubens, M. , 1996. Ranking and defuzzification methods based on area compensation. Fuzzy Sets and Systems, 82, 319–330.
  13. Wu, H. C. , 2010. Solving the fuzzy earliness and tardiness in scheduling problems by using Genetic algorithms. Expert Systems with Applications 37: 4860–4866.
  14. Lin, S. W. , Ying, K. C. , Lee, Z. J. , 2009. Metaheuristics for scheduling a non-permutation flow line manufacturing cell with sequence dependent family setup times, Computers and Operations Research, 36(4): 1110–1121.
  15. Kurz, M. E. , Askin, R. G. , 2004. Scheduling flexible flow lines with sequence dependent setup times, European Journal of Operational Research 159 (1): 66–82.
  16. Tavakkoli-Moghaddama, R. , Taheri, F. , Bazzazi, M. , Izadi, M. , Sassani, F. , 2009. Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints, Computers & Operations Research 36: 3224 – 3230.
  17. Moslehi, G. , Mirzaee, M. , Vasei, M. , Modarres, M. , Azaron, A. , 2009. Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness, Int. J. Production Economics 122:763–773.
Index Terms

Computer Science
Information Sciences

Keywords

Fuzzy simulation genetic algorithm flow shop scheduling just-in-time deteriorating jobs

Powered by PhDFocusTM