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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Metaheuristic approach for Batch Sizing and Scheduling Problem in Flexible Flow Shop with Unrelated Parallel Machines

by Ebrahim Asadi Gangraj, Nasim Nahavandi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 97 - Number 6
Year of Publication: 2014
Authors: Ebrahim Asadi Gangraj, Nasim Nahavandi
10.5120/17013-7292

Ebrahim Asadi Gangraj, Nasim Nahavandi . A Metaheuristic approach for Batch Sizing and Scheduling Problem in Flexible Flow Shop with Unrelated Parallel Machines. International Journal of Computer Applications. 97, 6 ( July 2014), 31-36. DOI=10.5120/17013-7292

@article{ 10.5120/17013-7292,
author = { Ebrahim Asadi Gangraj, Nasim Nahavandi },
title = { A Metaheuristic approach for Batch Sizing and Scheduling Problem in Flexible Flow Shop with Unrelated Parallel Machines },
journal = { International Journal of Computer Applications },
issue_date = { July 2014 },
volume = { 97 },
number = { 6 },
month = { July },
year = { 2014 },
issn = { 0975-8887 },
pages = { 31-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume97/number6/17013-7292/ },
doi = { 10.5120/17013-7292 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:24:58.487240+05:30
%A Ebrahim Asadi Gangraj
%A Nasim Nahavandi
%T A Metaheuristic approach for Batch Sizing and Scheduling Problem in Flexible Flow Shop with Unrelated Parallel Machines
%J International Journal of Computer Applications
%@ 0975-8887
%V 97
%N 6
%P 31-36
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This article considers a makespan minimization batch sizing and scheduling problem in a flexible flow shop scheduling problem with unrelated parallel machines and sequence dependent setup time. Because of NP-completeness of this problem, it is necessary to use the heuristics method. Therefore, this article presents a new mixed simulated-genetic algorithm (MSGA) to tackle this problem. In the comparison, this research reports optimality gaps which are calculated with respect to MSGA method and optimal solution for small instances and the average objective function for large instances. Computational studies indicate that the MSGA is computationally efficient and effective even for small and large instances.

References
  1. Coffman, E. G. and Yannakakis, M. 1990. batch sizing and sequencing on a single machine. Ann. Oper. Res. 26, 135-147.
  2. Quadt, D. and Kuhn, H. 2005. Conceptual framework for lot-sizing and scheduling of flexible flow lines. Int. J. of Prod. Res. 43(11), 2291-308.
  3. Adler, L. , Fraiman, N. , Kobacker, E. , Pinedo, M. , Plotnicoff, J. C. and Wu, T. P. 1993. BPSS: a scheduling support system for the packaging industry. Oper. Res. 41, 641-648.
  4. Voss, S. and Witt, A. 2007. Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: a real-world application. Inter. J. of Prod. Econ. 105(2), 445-458.
  5. Wittrock, R. J. 1988. An adaptable scheduling algorithm for flexible flow lines. Oper. Res. 36, 445-453.
  6. Leon, V. J. and Ramamoorthy, B. 1997. An adaptable problem space-based search method for flexible flow line scheduling. IIE Transactions. 29, 115-125.
  7. Agnetis, A. , Pacifici, A. , Rossi, F. , Lucertini, M. , Nicoletti, S. and Nicolo, F. 1997. Scheduling of flexible flow shop in an automobile assembly plant. Eur. J. of Oper. Res. 97(2), 348-362.
  8. Jin, Z. H. ; Ohno, K. ; Ito, T. ; Elmaghraby, S. E. : Scheduling hybrid flowshops in printed circuit board assembly lines. Prod. and Oper. Manag. 11(2), 216-230, (2002)
  9. Hayrinen, T. , Johnsson, M. , Johtela, T. , Smed, J. and Nevalainen, O. 2000. Scheduling algorithms for computer-aided line balancing in printed circuit board assembly. Prod. Planin. Con. 11(5), 497-510.
  10. Alisantoso, D. , Khoo, L. P. and Jiang, P. Y. 2003. An immune algorithm approach to the scheduling of a flexible PCB flow shop. Inter. J. of Adv. Manuf. Technol. 22(11), 819-827.
  11. Ruiz, R. and Maroto, C. 2006. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur. J. of Oper. Res. 169, 781-800.
  12. Lee, G. C. , Kim, Y. D. and Choi, S. W. . 2004. Bottleneck-focused scheduling for a hybrid flowshop. Int. J. of Prod. Res. 42, 165-181.
  13. Jungwattanakit, J. and Reodecha, M. Chaovalitwongse, P. and Werner, F. 2008. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria. Int. J. of Adv. Manuf. Technol. 37, 354-370.
  14. Sheikh, S. 2012. Multi-objective flexible flow lines with due window, time lag, and job rejection. Int. J. of Adv. Manuf. Technol. doi: 10. 1007/s00170-012-4112-5.
  15. Rosas-gonzález, A. , Clemente-guerrero, D. , Caballero-morales, S. and Flores-juan, J. 2013. An Evolutionary Approach for Solving the N-Jobs M-Machines Permutation Flow-Shop Scheduling Problem with Break-Down Times. Int. J. of Comput. Appl. 83(1); 1-6.
  16. Huang, K. Yang, C. and Tsai, C. 2012. A Two-Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem; Int. J. of Comput. Appl. 48(1),11-18
  17. Allahverdi, A. , NG, C. T. and Cheng, T. C. E. , and Kovalyov, M. Y. 2008. A survey of scheduling problems with setup times or costs. Eur. J. of Oper. Res. 187(3), 985-1032.
  18. Prasad, P. and Maravelias, C. T. 2008. Batch selection, assignment and sequencing in multi-stage multi-product processes. Comput. and Chem. Eng. 32, 1106-1119.
  19. Wang, S. and Guignard, M. 2006. Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems. Comput. and Oper. Res. 33, 971-993.
  20. Chrétienne, P. , Haz?r, Ö. and Kedad-Sidhoum, S. 2011. Integrated batch sizing and scheduling on a single machine. J. of Sched. 14, 541-555.
  21. Me´ndez, C. A. , Henning, G. P. and Cerda, J. 2011. An MILP continuous-time approach to short term scheduling of resource-constrained multistage flowshop batch facilities. Comput. and Oper. Res. 25, 701-711.
  22. Tadayon, B. and Salmasi, N. 2013. A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint. Int. J. of Adv. Manuf. Technol. 64, 1001-1015.
Index Terms

Computer Science
Information Sciences

Keywords

Batch sizing flexible flow shop metaheuristic method scheduling.

Powered by PhDFocusTM