Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » Journal of Project Management » Scheduling parallel extrusion lines

Journals

  • IJIEC (747)
  • MSL (2643)
  • DSL (668)
  • CCL (508)
  • USCM (1092)
  • ESM (413)
  • AC (562)
  • JPM (271)
  • IJDS (912)
  • JFS (96)
  • HE (32)
  • SCI (26)

JPM Volumes

    • Volume 1 (8)
      • Issue 1 (5)
      • Issue 2 (3)
    • Volume 2 (13)
      • Issue 1 (4)
      • Issue 2 (3)
      • Issue 3 (3)
      • Issue 4 (3)
    • Volume 3 (17)
      • Issue 1 (4)
      • Issue 2 (5)
      • Issue 3 (4)
      • Issue 4 (4)
    • Volume 4 (24)
      • Issue 1 (4)
      • Issue 2 (8)
      • Issue 3 (8)
      • Issue 4 (4)
    • Volume 5 (20)
      • Issue 1 (5)
      • Issue 2 (5)
      • Issue 3 (5)
      • Issue 4 (5)
    • Volume 6 (20)
      • Issue 1 (5)
      • Issue 2 (5)
      • Issue 3 (5)
      • Issue 4 (5)
    • Volume 7 (21)
      • Issue 1 (5)
      • Issue 2 (5)
      • Issue 3 (5)
      • Issue 4 (6)
    • Volume 8 (21)
      • Issue 1 (6)
      • Issue 2 (5)
      • Issue 3 (5)
      • Issue 4 (5)
    • Volume 9 (35)
      • Issue 1 (6)
      • Issue 2 (5)
      • Issue 3 (9)
      • Issue 4 (15)
    • Volume 10 (68)
      • Issue 1 (15)
      • Issue 2 (21)
      • Issue 3 (13)
      • Issue 4 (19)
    • Volume 11 (24)
      • Issue 1 (24)

Keywords

Supply chain management(166)
Jordan(161)
Vietnam(149)
Customer satisfaction(120)
Performance(113)
Supply chain(111)
Service quality(98)
Competitive advantage(95)
Tehran Stock Exchange(94)
SMEs(87)
optimization(86)
Trust(83)
TOPSIS(83)
Financial performance(83)
Sustainability(82)
Job satisfaction(80)
Factor analysis(78)
Social media(78)
Artificial intelligence(77)
Knowledge Management(77)


» Show all keywords

Authors

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


» Show all authors

Countries

Iran(2184)
Indonesia(1290)
India(788)
Jordan(786)
Vietnam(504)
Saudi Arabia(453)
Malaysia(441)
United Arab Emirates(220)
China(206)
Thailand(153)
United States(111)
Turkey(106)
Ukraine(104)
Egypt(98)
Canada(92)
Peru(88)
Pakistan(85)
United Kingdom(80)
Morocco(79)
Nigeria(78)


» Show all countries

Journal of Project Management

ISSN 2371-8374 (Online) - ISSN 2371-8366 (Print)
Quarterly Publication
Volume 9 Issue 1 pp. 1-16 , 2024

Scheduling parallel extrusion lines Pages 1-16 Right click to download the paper Download PDF

Authors: Fayez F. Boctor, Dhiaeddine Zaatour, Jacques Renaud

DOI: 10.5267/j.jpm.2023.11.002

Keywords: Production planning, Neighborhood search heuristics, Sequencing and scheduling

Abstract: This paper introduces the problem of scheduling jobs on parallel plastic extrusion lines where each line is composed of one or more than one extruder. Although there are some similarities between the introduced problem and the non-identical parallel machines scheduling problems with sequence-dependent setup times, limited additional resources and machine eligibility restrictions, the problem considered in this paper is a generalization of the parallel machine scheduling problem. This is because in parallel machines scheduling each job requires only one machine but in our case some jobs require more than one machine. Thus, our problem reduces to the parallel machine scheduling problem if all jobs require only one machine. This paper describes the problem of scheduling parallel extrusion lines, its industrial context, and develops a mixed-linear formulation to model the problem. This formulation allowed solving instances of up to 15 jobs. In addition, we developed four metaheuristics: a simulated annealing algorithm, a tabu search heuristic, a genetic algorithm, and a greedy randomized adaptive search procedure. These metaheuristics can be used to solve real-life instances of the problem. A numerical experiment shows that the proposed metaheuristics produce excellent solutions. Some of the proposed simulated annealing adaptations and of the tabu search heuristics obtained solutions with less than 2% deviation from the optimum.

How to cite this paper
Boctor, F., Zaatour, D & Renaud, J. (2024). Scheduling parallel extrusion lines.Journal of Project Management, 9(1), 1-16.

Refrences
Afzalirad, M., & Rezaeian J. (2016). Resource-constrained unrelated parallel machine scheduling problem with se-quence dependent setup times, precedence constraints and machine eligibility restrictions. Computers and Industrial Engineering, 98, 40-52.
Allahverdi A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. European Jour-nal of Operational Research, 246(2), 345–378.
Bacalhau, J. B., & Cunha, T. M. (2017). Effect of NI content on the hardenability of bainitic steel for processing of plas-tics, 24th ABCM International Congress of Mechanical Engineering December 3-8, 2017, Curitiba, PR, Brazil.
Bean, J. (1994). Genetic algorithms and random keys for sequencing and optimization, INFORMS Journal on Compu-ting, 6(2), 154–160.
Bilge, Ü., Kiraç, F., Kurtulan, M., & Peküng P. (2004). A Tabu search algorithm for parallel machine total tardiness problem. Computers and operations research, 31(3), 397-414.
Bilyk, A., & Mönch, L. (2012). A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines, Journal of Intelligent Manufacturing, 23(10), 1621-1635.
Boctor, F.F. (1996). Resource-constrained project scheduling by simulated annealing, International Journal of Production Research, 34(8), 2335-2351.
Dastidar, S.G. & Nagi, R. (2005). Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs, Computers and Operations Research, 32(11), 2987-3005.
Fanjul-Peyro L. & Ruiz R. (2011) Size-reduction heuristics for the unrelated parallel machines scheduling problem. Computers and Operations Research, 38(1), 301-309.
Fanjul-Peyro L. (2020) Models and an exact method for the Unrelated Parallel Machine scheduling problem with setups and resources, Expert systems with application, 5, 1-15.
Framinan, J-M., Leisten R. & Ruiz Garcia R. (2014). Manufacturing Scheduling Systems. Springer.
Gokhale, R., & Mathirajan, M. (2012). Scheduling identical parallel machines with machine eligibility restrictions to minimize total weighted flow time in automobile gear manufacturing. International journal of Advanced Manufacturing Technology, 60, 1190-110.
Ko, H.H., Kim, J., Kim, S.S., & Beak J.G. (2010). Dispatching rule for non-identical parallel machines with sequence dependent setups and quality restrictions, Computers and Industrial Engineering, 59(3), 448-457.
Kramer, A., Lori, M., & Lacomme, Ph. (2021). Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization, European Journal of Operational Research, 289(3), 464-474.
Lee, Y. H., & Pinedo, M. (1997). Scheduling jobs on parallel machines with sequence dependent setup times, European Journal of Operational Research, 100(3), 464-474.
Lee, J. Y., Kim, Y. D., & Lee, T.E. (2018). Minimizing total tardiness on parallel machines subject to flexible maintenance, International Journal of Industrial Engineering: Theory Applications and Practice, 25(4), 472- 489.
Logendran, R., McDonell, B., & Smucker, B. (2007). Scheduling unrelated parallel machines with sequence-dependent setups. Computers and operations research, 34(11), 3420 – 3438.
Mönch, L., Balasubramanian, H., Fowler, J. W., & Pfund, M. E. (2005). Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times, Computers and Operations Research, 32(11), 2731-2750.
Resende, M. G. C., & Ribeiro, C. C. (2008). Greedy Randomized adaptive search procedures: advances and applications, in Handbook of metaheuristics, Gendreau M. and Potvin J.Y. (eds.) Springer.
Rocha, P.L., Ravetti, M.G., Mateus, G.R. & Pardalos, P.M. (2008). Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Computers and Operations Research, 35(4), 1250 – 1264.
Rodriguez, F.J., Lozano, M., Blum, Ch., & Garcia-Martinez, C. (2013) An iterative greedy algorithm for the large-scale unrelated parallel machines scheduling problem. Computers and Operations Research, 40(6), 1829-1841.
Tavakkoli-Moghaddam, R., Taheri, F., Bazzazi, M., Izbad, M. & Sassani, F. (2009). Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup time and precedence constraints, Computers and Operations Research, 36(12), 3224-3230.
Unlu, Y., & Mason, S.J. (2010). Evaluation of mixed integer programming formulations for non-pre-emptive parallel machine scheduling problems, Computers and Industrial Engineering, 58(4), 785-800.
Wang, I.L., Wang, Y.C., & Chen, C.W. (2013). Scheduling unrelated parallel machines in semiconductors manufactur-ing by problem reduction and local search heuristics. Flexible Services and Manufacturing Journal, 25,343-366.
Wang, H., & Alidaee, B. (2019). Effective heuristic for large-scale unrelated parallel machines scheduling problem, Omega, 83(3), 261-274.
Wisner, J.D., & Siferd, S.P. (1995). A survey of US manufacturing practices in make-to-order machine shops. Produc-tion and Inventory Management Journal, 36(1), 1–7.
  • 51
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: Journal of Project Management | Year: 2024 | Volume: 9 | Issue: 1 | Views: 829 | Reviews: 0

Related Articles:
  • Bi-objective optimization of identical parallel machine scheduling with fle ...
  • A size-reduction algorithm for the order scheduling problem with total tard ...
  • A hybrid algorithm for unrelated parallel machines scheduling
  • Minimizing the total tardiness for the tool change scheduling problem on pa ...
  • An imperialist competitive algorithm for a bi-objective parallel machine sc ...

Add Reviews

Name:*
E-Mail:
Review:
Bold Italic Underline Strike | Align left Center Align right | Insert smilies Insert link URLInsert protected URL Select color | Add Hidden Text Insert Quote Convert selected text from selection to Cyrillic (Russian) alphabet Insert spoiler
winkwinkedsmileam
belayfeelfellowlaughing
lollovenorecourse
requestsadtonguewassat
cryingwhatbullyangry
Security Code: *
Include security image CAPCHA.
Refresh Code

® 2010-2026 GrowingScience.Com