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 » Authors » Fernando Luis Rossi

โญ Highly Cited Articles

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

Journals

  • IJIEC (804)
  • IJDS (992)
  • DSL (722)
  • ESM (434)
  • CCL (544)
  • JPM (323)
  • AC (567)
  • JFS (101)
  • MSL (2653)
  • USCM (1104)
  • HE (49)
  • SCI (50)

๐Ÿ”‘ Keywords

Supply chain management(168)
Jordan(167)
Vietnam(154)
Customer satisfaction(124)
Performance(116)
Supply chain(113)
Artificial intelligence(99)
Competitive advantage(98)
Service quality(98)
Tehran Stock Exchange(94)
SMEs(92)
Sustainability(91)
optimization(88)
TOPSIS(85)
Financial performance(84)
Trust(84)
Job satisfaction(81)
Knowledge Management(80)
Genetic Algorithm(80)
Social media(79)


» Show all keywords

โœ๏ธ Authors

Naser Azad(83)
Zeplin Jiwa Husada Tarigan(67)
Mohammad Reza Iravani(64)
Endri Endri(45)
Muhammad Alshurideh(42)
Hotlan Siagian(40)
Dmaithan Almajali(38)
Jumadil Saputra(36)
Muhammad Turki Alshurideh(35)
Ahmad Makui(33)
Barween Al Kurdi(32)
Sautma Ronni Basana(31)
Basrowi Basrowi(31)
Hassan Ghodrati(31)
Mohammad Khodaei Valahzaghard(30)
Haitham M. Alzoubi(30)
Shankar Chakraborty(29)
Ni Nyoman Kerti Yasa(29)
Prasadja Ricardianto(28)
Sulieman Ibraheem Shelash Al-Hawary(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 (8)
16. Brazil (40)
17. Brunei (1)
18. Bulgaria (1)
19. Burkina Faso (1)
20. Cameroon (1)
Total: 121 countries

Show all countries
Sort articles by: ๐Ÿ“– Volume | ๐Ÿ“… Date | โญ Most Rates | ๐Ÿ‘๏ธ Most Views | ๐Ÿš€ Rising Stars | ๐Ÿ”— Citations (Scopus) | ๐Ÿ”ฅ Hot Papers
1.

An effective iterated greedy heuristic for the flow shop scheduling with heterogeneous workers Pages 709-720 Right click to download the paper Download PDF

Authors: Fernando Luis Rossi, Esra Boz, Marcelo Seido Nagano

doi 10.5267/j.ijiec.2026.2.001

๐Ÿ”‘ Keywords: Flow shop, Heterogeneous workers, Iterated greedy, Scheduling, Metaheuristics

Abstract:
This paper addresses the Permutation Flow Shop Scheduling Problem with Heterogeneous Workers (PFSP-HW), an extension of the classical problem in which processing times depend not only on the job and machine, but also on the assigned worker. This variant better reflects practical environments where worker capabilities and proficiencies vary significantly. We propose a new Iterated Greedy (IG) heuristic adapted to handle worker heterogeneity. The IG heuristic combines destruction and reconstruction mechanisms with a local search procedure tailored for the problem. We develop two versions of the proposed algorithm and compare them with adapted state-of-the-art heuristics and metaheuristics from related problems. The algorithms were tested on a large benchmark set comprising 360 instances generated under various shop configurations. The suggested IG heuristics surpass current approaches in terms of solution quality and execution time, as determined by computational and statistical evaluations, making them reliable and efficient tools for solving the PFSP-HW.
Details
  • 0
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: IJIEC | Year: 2026 | Volume: 17 | Issue: 2 | Views: 504

 
2.

A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time Pages 45-60 Right click to download the paper Download PDF

Authors: Marcelo Seido Nagano, Fernando Luis Rossi

doi 10.5267/j.jpm.2023.9.001

๐Ÿ”‘ Keywords: Mixed no-idle, Makespan, Total completion time, Multi-objective

Abstract:
Advanced production systems usually are complex in nature and aim to deal with multiple performance measures simultaneously. Therefore, in most cases, the consideration of a single objective function is not sufficient to properly solve scheduling problems. This paper investigates the multi-objective mixed no-idle flowshop scheduling problem. The addressed optimization case is minimizing makespan subject to an upper bound on total completion time. To solve this problem, we proposed a two-stage iterated greedy and a multi-objective constructive heuristic. Moreover, we developed a new multi-objective improvement procedure focusing on increasing the performance of the developed methods in solving the addressed problem. and a new initialization procedure. We performed several computational tests in order to compare our developed methods with the main algorithms from similar scheduling problems in the literature. It was revealed that the proposed approaches give the best results compared with other state-of-the-art performing methods.
Details
  • 68
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: JPM | Year: 2024 | Volume: 9 | Issue: 1 | Views: 1675

 

® 2010-2026 GrowingScience.Com