Processing, Please wait...

  • Publisher Home
  • Home
  • 🔙 Back
  • 📚 Journals
    • ⚙️ IJIEC - Industrial Engineering Computations
    • 🌐 IJDNS - Data and Network Science
    • 🧪 CCL - Current Chemistry Letters
    • 💹 AC - Accounting
    • 🎯 DSL - Decision Science Letters
    • 🚛 USCM - Uncertain Supply Chain Management
    • 🏗️ JPM - Journal of Project Management
    • 🏥 HE - Healthcare Engineering
    • 📈 SCI - Scientometrica
    • 🔩 ESM - Engineering Solid Mechanics
    • 🌿 JFS - Journal of Future Sustainability
    • 💼 MSL - Management Science Letters
  • 📝 Submit Article
  • 📊 Statistics
  • 📋 About
    • 📄 About Us
    • 📰 Blog
    • 📢 News
    • 📧 Contact
  • 📺 Tutorial
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan

⭐ Highly Cited Articles

  • Jaya Algorithm
  • Rao Algorithm
  • TLBO Algorithm
  • ChatGPT and Blended Learning

Journals

  • IJIEC (840)
  • IJDS (1032)
  • DSL (759)
  • ESM (434)
  • CCL (563)
  • JPM (350)
  • AC (572)
  • JFS (106)
  • MSL (2658)
  • USCM (1104)
  • HE (56)
  • SCI (53)

IJIEC Volumes

    • ▼ Volume 17 (113)
      • Issue 1 (21)
      • Issue 2 (30)
      • Issue 3 (26)
      • Issue 4 (36)
    • ▼ Volume 16 (75)
      • Issue 1 (12)
      • Issue 2 (15)
      • Issue 3 (19)
      • Issue 4 (29)
    • ▼ Volume 15 (55)
      • Issue 1 (19)
      • Issue 2 (15)
      • Issue 3 (12)
      • Issue 4 (9)
    • ▼ Volume 14 (50)
      • Issue 1 (11)
      • Issue 2 (15)
      • Issue 3 (9)
      • Issue 4 (15)
    • ▼ Volume 13 (41)
      • Issue 1 (10)
      • Issue 2 (8)
      • Issue 3 (10)
      • Issue 4 (13)
    • ▼ Volume 12 (29)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (8)
      • Issue 4 (6)
    • ▼ Volume 11 (36)
      • Issue 1 (9)
      • Issue 2 (8)
      • Issue 3 (9)
      • Issue 4 (10)
    • ▼ Volume 10 (34)
      • Issue 1 (8)
      • Issue 2 (10)
      • Issue 3 (8)
      • Issue 4 (8)
    • ▼ Volume 9 (32)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (7)
      • Issue 4 (10)
    • ▼ Volume 8 (30)
      • Issue 1 (9)
      • Issue 2 (7)
      • Issue 3 (8)
      • Issue 4 (6)
    • ▼ Volume 7 (47)
      • Issue 1 (10)
      • Issue 2 (14)
      • Issue 3 (10)
      • Issue 4 (13)
    • ▼ Volume 6 (39)
      • Issue 1 (7)
      • Issue 2 (12)
      • Issue 3 (10)
      • Issue 4 (10)
    • ▼ Volume 5 (47)
      • Issue 1 (13)
      • Issue 2 (12)
      • Issue 3 (12)
      • Issue 4 (10)
    • ▼ Volume 4 (50)
      • Issue 1 (14)
      • Issue 2 (10)
      • Issue 3 (12)
      • Issue 4 (14)
    • ▼ Volume 3 (77)
      • Issue 1 (10)
      • Issue 2 (15)
      • Issue 3 (20)
      • Issue 4 (12)
      • Issue 5 (20)
    • ▼ Volume 2 (68)
      • Issue 1 (12)
      • Issue 2 (20)
      • Issue 3 (20)
      • Issue 4 (16)
    • ▼ Volume 1 (17)
      • Issue 1 (9)
      • Issue 2 (8)

🔑 Keywords

Jordan(175)
Supply chain management(172)
Vietnam(154)
Customer satisfaction(124)
Performance(117)
Supply chain(115)
Artificial intelligence(108)
Service quality(101)
Competitive advantage(100)
SMEs(95)
Tehran Stock Exchange(94)
Sustainability(94)
optimization(88)
Financial performance(86)
TOPSIS(85)
Trust(85)
Organizational performance(81)
Job satisfaction(81)
Genetic Algorithm(81)
Social media(80)


» Show all keywords

✍️ Authors

Naser Azad(82)
Zeplin Jiwa Husada Tarigan(70)
Mohammad Reza Iravani(65)
Endri Endri(45)
Hotlan Siagian(43)
Muhammad Alshurideh(42)
Dmaithan Almajali(39)
Jumadil Saputra(37)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Sautma Ronni Basana(33)
Barween Al Kurdi(32)
Basrowi Basrowi(31)
Mohammad Khodaei Valahzaghard(30)
Haitham M. Alzoubi(30)
Ni Nyoman Kerti Yasa(30)
Hassan Ghodrati(30)
Shankar Chakraborty(29)
Sulieman Ibraheem Shelash Al-Hawary(28)
Mahmoud Allahham(28)


» Show all authors

🌍 Countries

1. Algeria (52)
2. Angola (2)
3. Argentina (22)
4. Armenia (2)
5. Australia (52)
6. Austria (2)
7. Bahrain (26)
8. Bangladesh (58)
9. Belarus (4)
10. Belgium (3)
11. Benin (2)
12. Benin Republic (1)
13. Bhutan (1)
14. Bosnia and Herzegovina (1)
15. Botswana (9)
16. Brazil (40)
17. Brunei (1)
18. Bulgaria (1)
19. Burkina Faso (1)
20. Cameroon (1)
Total: 121 countries

Show all countries
International Journal of Industrial Engineering Computations
ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print)
Quarterly Publication
Volume 7 Issue 2 pp. 309-322, 2016

M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan Pages 309-322 PDF Download PDF

Authors: V. Azizi, M. Jabbari, A. S. Kheirkhah

📋 Author Affiliations:
V. Azizi1, M. Jabbari ORCID 2, A.S. Kheirkhah ORCID 1
1 Department of Industrial Engineering, K. N. Toosi University of Technology, Iran
2 Department of Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran
doi 10.5267/j.ijiec.2015.9.004
10 Source: Scopus
Crossref 8 Source: CrossRef

🔑 Keywords: Genetic Algorithm, Learning effect, No-wait flowshop, Simulated Annealing, Truncated learning parameter

Abstract: Recently, learning effects have been studied as an interesting topic for scheduling problems, however, most researches have considered single or two-machine settings. Moreover, learning factor has been considered for job times instead of setup times and the same learning effect has been used for all machines. This paper studies the m-machine no-wait flowshop scheduling problem considering truncated learning effect in no-wait flowshop environment. In this problem, setup time is a function of job position in the sequence with a learning truncation parameter and each machine has its own learning effect. In this paper, a mixed integer linear programming is proposed for the problem to solve such problem. This problem is NP-hard so an improved genetic algorithm (GA) and a simulated annealing (SA) algorithm are developed to find near optimal solutions. The accuracy and efficiency of the proposed procedures are tested against different criteria on various instances. Numerical experiments approve that SA outperforms in most instances.

How to cite this paper
APA: Azizi, V., Jabbari, M & Kheirkhah, A. (2016). M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan. International Journal of Industrial Engineering Computations, 7(2), 309-322.
Chicago/Turabian: Azizi, V., Jabbari, M & Kheirkhah, A. 2016. "M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan." International Journal of Industrial Engineering Computations 7, no. 2 (2016): 309-322.
AMA: Azizi, V., Jabbari, M & Kheirkhah, A. M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan. International Journal of Industrial Engineering Computations. 2016;7(2):309-322.

References
Allahverdi, A., & Aldowaisan, T. (2001). Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times. Journal of the Operational Research Society, 52(4), 449-462.

Allahverdi, A., & Aydilek, H. (2014). Total completion time with makespan constraint in no-wait flowshops with setup times. European Journal of Operational Research, 238(3), 724-734.‏

Allahverdi, A., & Aldowaisan, T. (2002). No-wait flowshops with bicriteria of makespan and total completion time. Journal of the Operational Research Society, 53(9),1004-1015.

Ben Chihaoui, F., Kacem, I., Hadj-Alouane, A. B., Dridi, N., & Rezg, N. (2011). No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates. International Journal of Production Research, 49(21), 6273-6286.

Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115(1), 173-178.

Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188(2), 315-329.

Chen, P., Wu, C. C., & Lee, W. C. (2006). A bi-criteria two-machine flowshop scheduling problem with a learning effect. Journal of the Operational Research Society, 57(9), 1113-1125.

Cheng, T. C. E., Wu, C. C., Chen, J. C., Wu, W. H., & Cheng, S. R. (2013). Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. International Journal of Production Economics, 141(1), 79-86.

Cheng, T. E., & Wang, G. (2000). Single machine scheduling with learning effect considerations. Annals of Operations Research, 98(1-4), 273-290.

Ding, J. Y., Song, S., Gupta, J. N., Zhang, R., Chiong, R., & Wu, C. (2015). An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing, 30, 604-613.‏

Eren, T., & Güner, E. (2008). A bicriteria flowshop scheduling with a learning effect. Applied Mathematical Modelling, 32(9), 1719-1733.

Goldberg, D. E., & Holland, J. H. (1988). Genetic algorithms and machine learning. Machine learning, 3(2), 95-99.

??ler, M. C., Toklu, B., & Celik, V. (2012). Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect. The International Journal of Advanced Manufacturing Technology, 61(9-12), 1129-1137.

Janiak, A., Janiak, W. A., Rudek, R., & Wielgus, A. (2009). Solution algorithms for the makespan minimization problem with the general learning model. Computers & Industrial Engineering, 56(4), 1301-1308.

Kirkpatrick, S., & Vecchi, M. P. (1983). Optimization by simmulated annealing. Science, 220(4598), 671-680.

Lai, K., Hsu, P. H., Ting, P. H., & Wu, C. C. (2014). A Truncated Sum of Processing?Times–Based Learning Model for a Two?Machine Flowshop Scheduling Problem. Human Factors and Ergonomics in Manufacturing & Service Industries, 24(2), 152-160.‏

Lee, W. C., & Wu, C. C. (2004). Minimizing total completion time in a two-machine flowshop with a learning effect. International Journal of Production Economics, 88(1), 85-93.

Lee, W. C., & Wu, C. C. (2009). Some single-machine and m-machine flowshop scheduling problems with learning considerations. Information Sciences, 179(22), 3885-3892.

Li, D. C., Hsu, P. H., Wu, C. C., & Cheng, T. E. (2011). Two-machine flowshop scheduling with truncated learning to minimize the total completion time. Computers & Industrial Engineering, 61(3), 655-662.

Liu, Y., & Feng, Z. (2014). Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Computers & Industrial Engineering, 75, 170-175.‏

Murata, T., Ishibuchi, H., & Tanaka, H. (1996). Genetic algorithms for flowshop scheduling problems. Computers & Industrial Engineering, 30(4), 1061-1071.

Nagano, M. S., & Ara?jo, D. C. (2014). New heuristics for the no-wait flowshop with sequence-dependent setup times problem. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 36(1), 139-151.‏

Nagano, M. S., Da Silva, A. A., & Lorena, L. A. N. (2014). An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times. Expert Systems with Applications, 41(8), 3628-3633.‏

R?ck, H. (1984). The three-machine no-wait flowshop is NP-complete. Journal of the ACM (JACM), 31(2), 336-345.

Samarghandi, H., & ElMekkawy, T. Y. (2014). Solving the no-wait flow-shop problem with sequence-dependent set-up times. International Journal of Computer Integrated Manufacturing, 27(3), 213-228.‏

Shiau, Y. R., Tsai, M. S., Lee, W. C., & Cheng, T. C. E. (2015). Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Computers & Industrial Engineering, 87, 580-589.‏

Wang, J. B., & Liu, L. L. (2009). Two-machine flowshop problem with effects of deterioration and learning. Computers & Industrial Engineering, 57(3), 1114-1121.

Wang, J. B., & Wang, J. J. (2014). Flowshop scheduling with a general exponential learning effect. Computers & Operations Research, 43, 292-308.‏

Wang, J. B., & Xia, Z. Q. (2005). Flow-shop scheduling with a learning effect. Journal of the Operational Research Society, 56(11), 1325-1330.

Wang, J. J., & Zhang, B. H. (2015). Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Computers & Operations Research, 58, 24-31.‏

Wu, C. C., Lee, W. C., & Wang, W. C. (2007). A two-machine flowshop maximum tardiness scheduling problem with a learning effect. The International Journal of Advanced Manufacturing Technology, 31(7-8), 743-750.

Wu, Y. B., & Wang, J. J. (2015). Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Computing and Applications, 1-7.‏

Wu, W. H., Wu, W. H., Chen, J. C., Lin, W. C., Wu, J., & Wu, C. C. (2015). A heuristic-based genetic algorithm for the two-machine flowshop scheduling with learning consideration. Journal of Manufacturing Systems, 35, 223-233.‏

Ying, K. C., Lee, Z. J., Lu, C. C., & Lin, S. W. (2012). Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups. The International Journal of Advanced Manufacturing Technology, 58(5-8), 671-682.

Zhu, X., & Li, X. (2014). Iterative search method for total flowtime minimization no-wait flowshop problem. International Journal of Machine Learning and Cybernetics, 1-15.‏
  • 34
  • 1
  • 2
  • 3
  • 4
  • 5

📚 Journal: International Journal of Industrial Engineering Computations | 📅 Year: 2016 | 📖 Volume: 7 | 📄 Issue: 2 | 👁️ Views: 3336 | 📊 Crossref: 8

Related Articles:
  • Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown
  • A new effective heuristic method for the no-wait flowshop with sequence-dependent setup times problem
  • Scheduling stochastic two-machine flow shop problems to minimize expected makespan
  • A two-phase fuzzy programming model for a complex bi-objective no-wait flow shop scheduling
  • Heuristics for production scheduling problem with machining and assembly operations

📝 Ready to share your research?

International Journal of Industrial Engineering Computations is accepting new submissions for upcoming issues. Join our community of authors and publish your work with us.

✓ Open access
✓ Rigorous peer review
✓ Fast publication
📤 Submit Your Manuscript →

📖 Author Guidelines

® 2010-2026 GrowingScience.Com