Results 81 to 90 of about 7,634,020 (164)

A Review of Advances in Composite Materials, Structural Optimization, and Machine Learning for Wind Turbine Blades: Challenges and Future Perspectives

Polymer Composites, Volume 47, Issue 18, Page 16125-16154, 20 September 2026.
Overview of the holistic engineering lifecycle and core research pillars for wind turbine blades. ABSTRACT This paper reviews recent advancements across the lifecycle of wind turbine blades, focusing on three interconnected areas: advanced composites, structural optimization, and machine learning (ML) diagnostics. In materials, we highlight progress in
Kemal Hasirci, Denizhan Yavas, Alaeddin Burak Irez   +2 more
wiley   +1 more source

Local search performance guarantees for restricted related parallel machine scheduling [PDF]

We consider the problem of minimizing the makespan on restricted related parallel machines. In restricted machine scheduling each job is only allowed to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In
Recalde Diego, Rutten Cyriel, Vredeveld Tjark, Schuurman Petra   +3 more
core  

A hybrid genetic approach to solve real make-to-order job shop scheduling problems [PDF]

, 1997
Tese (doutorado) - Universidade Federal de Santa Catarina, Centro TecnologicoProcedimentos de busca local (ex. busca tabu) e algoritmos genéticos têm apresentado excelentes resultados em problemas clássicos de programação da produção em ambientes job ...
Candido, Marco Antonio Barbosa
core  

A Predictive-reactive Approach for JSP with Uncertain Processing Times [PDF]

, 2010
The paper is supported by the Asia-Link project funded by the European Commission (CN/ASIA-LINK/024 (109093)), the National Natural Science Foundation of China (50705076, 50705077), and the National Hi-Tech R&D Program of China (2007AA04Z187)JSP with ...
NIU, Ganggang, ROUCOULES, Lionel, LAFON, Pascal, SUN, Shudong   +3 more
core  

Improved Heuristics for the Early/Tardy Scheduling Problem with No Idle Time [PDF]

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules.
Rui A. F. S. Alves, Jorge M. S. Valente
core  

Scheduling a single machine with multiple due dates per job

565585In this paper, we consider single-machine scheduling with multiple due dates per job. This is motivated by several industrial applications, where it is not important by how much we miss a due date.
Heydrich, Sandy, Kühn, Raphael, Weiß, Christian, Ackermann, Heiner   +3 more
core   +1 more source

Resource-constrained project scheduling. [PDF]

: Resource-constrained project scheduling involves the scheduling of project activities subject to precedence and resource constraints in order to meet the objective(s) in the best possible way. The area covers a wide variety of problem types.
Herroelen, Willy, Demeulemeester, Erik
core  

Better approximation guarantees for job-shop scheduling [PDF]

Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee.
Paterson, Michael S., Srinavasan, Aravind, Goldberg, Leslie Ann, Sweedyk, Elizabeth   +3 more
core  

Energy-aware flexible job shop scheduling under time-of-use pricing with renewable, battery storage and preventive maintenance. [PDF]

Sci Rep
Zahid A, Leclaire P, Hammadi L, Costa Affonso R, El Ballouti A.   +4 more
europepmc   +1 more source

Project scheduling under undertainty – survey and research potentials. [PDF]

The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the
Herroelen, Willy, Leus, Roel
core