Skip to main content

Advertisement

SpringerLink
Log in

Scheduling and worker assignment problems on hybrid flowshop with cost-related objective function

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper proposes a colonial competitive algorithm which is improved by variable neighborhood search algorithm for the simultaneous effects of learning and deterioration on hybrid flowshop scheduling with sequence-dependent setup times. By the effects of learning and deterioration, the processing time of a job is determined by position in the sequence and its execution start time. In addition, it is assumed that the processing time of any job depends on the number of workers assigned to the job on a particular stage, and the more workers assigned to a stage, the shorter the job processing time. These additional traits that are added to the scheduling problem coexist in many realistic scheduling situations. This problem consists of two basic questions of job scheduling and worker assignment. Minimization of the earliness, tardiness, makespan, and total worker employing costs is considered as the objective function. To evaluate the performance of the hybrid colonial competitive algorithm, the random key genetic algorithm, immune algorithm, variable neighborhood search, and hybrid simulated annealing metaheuristic presented previously are investigated for comparison purposes, and computational experiments are performed on standard test problems. Results show that our proposed algorithm performs better than the other algorithms for various test problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akrami B, Karimi B, Moattar Hosseini SM (2006) Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case. Appl Math Comput 183:634–645

    Article  MATH  MathSciNet  Google Scholar 

  2. Alaykiran K, Engin O, Döyen A (2007) Using ant colony optimization to solve hybrid flowshop scheduling problems. Int J Adv Manuf Technol 35(5–6):541–550

    Article  Google Scholar 

  3. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032

    Article  MATH  MathSciNet  Google Scholar 

  4. Andres C et al (2005) Group technology in a hybrid flowshop environment: a case study. Eur J Oper Res 167:272–281

    Article  MATH  MathSciNet  Google Scholar 

  5. Arthanari TS, Ramamurthy KG (1971) An extension of two machines sequencing problem. Opsearch 8(1):10–22

    MathSciNet  Google Scholar 

  6. Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. IEEE Congress on Evolutionary Computation, Singapore, pp 4661–4667

    Google Scholar 

  7. Atashpaz-Gargari E, Hashemzadeh F, Rajabioun R, Lucas C (2008) Colonial competitive algorithm: a novel approach for PID controller design in MIMO distillation column process. Int J Intell Comput Cybern 1(3):337–355

    Article  MathSciNet  Google Scholar 

  8. Azizoglu M, Cakmak E, Kondakci S (2001) A flexible flowshop problem with total flow time minimization. Eur J Oper Res 132:528–538

    Article  MATH  MathSciNet  Google Scholar 

  9. Baker KR (1994) Elements of sequencing and scheduling. HN, Hanover

    Google Scholar 

  10. Behnamian J, Fatemi Ghomi SMT, Zandieh M (2010) Development of a hybrid metaheuristic to minimizing earliness and tardiness in hybrid flowshop with sequence-dependent setup times. Int J Prod Res 48(5):1415–1438

    Article  MATH  Google Scholar 

  11. Biabangard-Oskouyi A, Atashpaz-Gargari E, Soltani N, Lucas C (2009) Application of imperialist competitive algorithm for materials property characterization from sharp indentation test. Int J Eng Simul 10(1):11–12

    Google Scholar 

  12. Botta-Genoulaz V (2000) Hybrid flowshop scheduling with precedence constraints and time lags to minimize maximum lateness. Int J Prod Econ 64(1–3):101–111

    Article  Google Scholar 

  13. Chaudhry IA, Drake PR (2009) Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms. Int J Adv Manuf Technol 42:581–594

    Article  Google Scholar 

  14. Cheng TCE, Wu C-C, Lee W-C (2008) Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 54(4):972–982

    Article  Google Scholar 

  15. Duan H, Xu C, Liu S, Shao S (2010) Template matching using chaotic imperialist competitive algorithm. Pattern Recogn Lett 31(13):1868–1875

    Article  Google Scholar 

  16. Forouharfard S, Zandieh M (2011) An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems. Int J Adv Manuf Technol 51(9–12):1179–1193

    Google Scholar 

  17. Gholami M, Zandieh M, Alem-Tabriz A (2009) Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int J Adv Manuf Technol 42(1–2):189–201

    Article  Google Scholar 

  18. Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387–393

    Article  Google Scholar 

  19. Harjunkoski I, Grossmann IE (2002) Decomposition techniques for multistage scheduling problems using mixed integer and constraint programming methods. Comput Chem Eng 26(11):1533–1552

    Article  Google Scholar 

  20. Hu P-C (2004) Minimising total tardiness for the worker assignment scheduling problem in identical parallel-machine models. Int J Adv Manuf Technol 23:383–388

    Article  Google Scholar 

  21. Hu P-C (2005) Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models. Int J Adv Manuf Technol 25:1046–1052

    Article  Google Scholar 

  22. Hu P-C (2006) Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel machine models. Int J Adv Manuf Technol 29:165–169

    Article  Google Scholar 

  23. Hu P-C (2006) Further study of minimizing total flowtime for the worker assignment scheduling problem in the identical parallel-machine models. Int J Adv Manuf Technol 29:753–757

    Article  Google Scholar 

  24. Janiak A, Kozan E, Lichtenstein M, Oguz C (2007) Metaheuristic approaches to the hybrid flowshop scheduling problem with a cost-related criterion. Int J Prod Econ 105:407–424

    Article  Google Scholar 

  25. Jasour, A.M, Atashpaz, E. Lucas, C. Vehicle fuzzy control using imperialist competitive algorithm. Second Iranian Joint Congress on Fuzzy and Intelligent Systems (IFIS 2008), Tehran, Iran, 2008

  26. Jolai F, Sangari MS, Babaie M (2010) Pareto simulated annealing and colonial competitive algorithm to solve an offline scheduling problem with rejection. Proc IME B J Eng Part B J Eng Manuf 224(7):1119–1131

    Google Scholar 

  27. Jungwattanaki, J, Reodecha, M, Chaovalitwongse, P. Werner, F. An evaluation of sequencing heuristics for flexible flowshop scheduling problems with unrelated parallel machines and dual criteria. Otto-von-Guericke-Universitat Magdeburg, Preprint 28/05, 1–23, 2005.

  28. Khabbazi A, Atashpaz-Gargari E, Lucas C (2009) Imperialist competitive algorithm for minimum bit error rate beamforming. Int J Bio-Inspired Comput 1(1–2):125–133

    Article  Google Scholar 

  29. Kim Y-D, Joo B-J, Shin J-H (2009) Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. J Heuristics 15(1):19–42

    Article  Google Scholar 

  30. Kuo WH, Yang D-L (2007) Single machine scheduling with past-sequence-dependent setup times and learning effects. Inf Process Lett 102:22–26

    Article  MATH  MathSciNet  Google Scholar 

  31. Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159:66–82

    Article  MATH  MathSciNet  Google Scholar 

  32. Kurz ME, Askin RG (2003) Comparing scheduling rules for flexible flow lines. Int J Prod Econ 85:371–388

    Article  Google Scholar 

  33. Lauff V, Werner F (2004) Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey. Math Comput Model 40:637–656

    Article  MATH  MathSciNet  Google Scholar 

  34. Lee GC, Kim YD, Kim JG, Choi SH (2003) A dispatching rulebased approach to production scheduling in a printed circuit board manufacturing system. J Oper Res Soc 54:1038–1049

    Article  MATH  Google Scholar 

  35. de Lopes MJP, Carvalho JMV (2007) A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur J Oper Res 176(3):1508–1527

    Article  MATH  Google Scholar 

  36. Lucas C, Nasiri-Gheidari Z, Tootoonchian F (2010) Application of an imperialist competitive algorithm to the design of a linear induction motor. Energy Convers Manag 51(7):1407–1411

    Article  Google Scholar 

  37. M’Hallah R (2007) Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Comput Oper Res 34:3126–3142

    Article  MATH  Google Scholar 

  38. Montgomery DC (2000) Design and analysis of experiments, 5th edn. John Wiley & Sons, NY

    Google Scholar 

  39. Mosheiov G (2001) Parallel machine scheduling with a learning effect. J Oper Res Soc 52:1165–1169

    Article  MATH  Google Scholar 

  40. Naderi B, Zandieh M, Khaleghi Ghoshe Balagh A, Roshanaei V (2009) An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36:9625–9633

    Article  Google Scholar 

  41. Nazari-Shirkouhi S, Eivazy H, Ghodsi R, Rezaie K, Atashpaz-Gargari E (2010) Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm. Expert Syst Appl 37(12):7615–7626

    Article  Google Scholar 

  42. Niknam T, Taherian Fard E, Pourjafarian N, Rousta A (2011) An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering. Eng Appl Artif Intel 24(2):306–317

    Article  Google Scholar 

  43. Pinedo ML (2008) Scheduling: theory, algorithms, and systems (3rd ed.). Springer Science + Business Media, LLC, New York

    Google Scholar 

  44. Quadt D, Kuhn H (2007) A taxonomy of flexible flow line scheduling procedures. Eur J Oper Res 178:686–69

    Article  MATH  MathSciNet  Google Scholar 

  45. Rajabioun R, Atashpaz-Gargari E, Lucas C (2008) Colonial competitive algorithm as a tool for nash equilibrium point achievement. Lect Notes Comput Sci 5073:680–695

    Article  Google Scholar 

  46. Rajabioun, R, et al. Identification of a MIMO evaporator and its decentralized PID controller tuning using colonial competitive algorithm. Proceedings of the 17th World Congress, The International Federation of Automatic Control, Seoul, Korea, July 2008, pp. 9952–9957, 2008

  47. Rocha M, Gómez Ravetti M, Mateus GR, Pardalos PM (2007) Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighborhood search. IMA J Manag Math 18:101–115

    MATH  MathSciNet  Google Scholar 

  48. Sepehri Rad, H, Lucas, C. Application of imperialistic competition algorithm in recommender systems. In 13th international CSI computer conference (CSICC’08), Kish Island, Iran, 2008.

  49. Shabtay D, Steiner G (2008) The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Ann Oper Res 159:25–40

    Article  MATH  MathSciNet  Google Scholar 

  50. Shokrollahpour E, Zandieh M, Dorri B (2011) A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. Int J Prod Res 49(11):3087–3103

    Article  Google Scholar 

  51. Sourd F (2005) Earliness/tardiness scheduling with setup considerations. Comput Oper Res 32:1849–1865

    Article  MATH  MathSciNet  Google Scholar 

  52. Tang LX, Xuan H, Liu J (2006) A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. Comput Oper Res 33:3344–3359

    Article  MATH  Google Scholar 

  53. Toksari MD, Güner E (2008) Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int J Adv Manuf Technol 38:801–808

    Article  Google Scholar 

  54. Toksari MD, Güner E (2009) Scheduling problems with the nonlinear effects of learning and deterioration. Int J Adv Manuf Technol 45(7–8):801–807

    Article  Google Scholar 

  55. Toksari MD, Güner E (2009) Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration. Comput Oper Res 36:2394–2417

    Article  MATH  Google Scholar 

  56. Wang X, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur J Oper Res 178(1):57–70

    Article  MATH  Google Scholar 

  57. Wang X, Tang L (2009) A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers. Comput Oper Res 36:907–918

    Article  MATH  Google Scholar 

  58. Wardono B, Fathi Y (2004) A tabu search algorithm for the multi-stage parallel machine problems with limited buffer capacities. Eur J Oper Res 155:380–401

    Article  MATH  MathSciNet  Google Scholar 

  59. Wright TP (1936) Factors affecting the cost of airplanes. J Aeronaut Sci 3:122–128

    Article  Google Scholar 

  60. Yelle LE (1979) The learning curve: historical review and comprehensive survey. Decis Sci 10:302–328

    Article  Google Scholar 

  61. Ying K-C (2009) An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. J Oper Res Soc 60:810–817

    Article  MATH  Google Scholar 

  62. Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flowshops scheduling with sequence-dependent setup times. Appl Math Comput 180:111–127

    Article  MATH  MathSciNet  Google Scholar 

  63. Zhu Z, Heady RB (2000) Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Comput Ind Eng 38:297–305

    Article  Google Scholar 

  64. Naderi B, Zandieh M, Aminnayeri M (2011) Incorporating periodic preventive maintenance into flexible flowshop scheduling problems. Appl Soft Comput 11(2):2094–2101

    Article  Google Scholar 

  65. Shiau D-F, Huang YM (2012) A hybrid two-phase encoding particle swarm optimization for total weighted completion time minimization in proportionate flexible flow shop scheduling. Int J Adv Manuf Technol 58(1–4):339–357

    Article  Google Scholar 

  66. Dai M, Tang D, Zheng K, Cai Q (2013) An improved genetic-simulated annealing algorithm based on a hormone modulation mechanism for a flexible flow-shop scheduling problem. Adv Mech Eng. doi:10.1155/2013/124903

    Google Scholar 

  67. Cui Z, Gu X (2014) A discrete group search optimizer for hybrid flowshop scheduling problem with random breakdown. Math Probl Eng. doi:10.1155/2014/621393

    Google Scholar 

  68. Huang RH, Yu SC (2013) Clarifying cutting and sewing processes with due windows using an effective ant colony optimization. Math Probl Eng. doi:10.1155/2013/182598

    Google Scholar 

  69. Mousavi SM, Zandieh M, Yazdani MA (2012) A simulated annealing/local search to minimize the makespan and total tardiness on a hybrid flowshop. Int J Adv Manuf Technol. doi:10.1007/s00170-012-4031-5

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran

    J. Behnamian

Authors
  1. J. Behnamian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Behnamian.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Behnamian, J. Scheduling and worker assignment problems on hybrid flowshop with cost-related objective function. Int J Adv Manuf Technol 74, 267–283 (2014). https://doi.org/10.1007/s00170-014-5960-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-014-5960-y

Keywords

Search

Navigation