Results 31 to 40 of about 25,495 (197)
, 2016 Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results.
Boyar, Joan +4 more
core +1 more source
Jurnal Teknik Industri, 2023 This research examined the scheduling of jobs with multiple stages unto identical parallel machines to minimize the makespan. The work is motivated by a Flexible Manufacturing System case that produces various parts and has multiple machining centers ...
Eka Pakpahan, Kenneth David Sumarna
doaj +1 more source
Development and characterization of treated kaolin filled polypropylene/kaolin nanocomposites [PDF]
, 2018 This research work focused on producing modified kaolin filler in polypropylene/kaolin (PP/K) nanocomposite by melt compounding process in order to improve its mechanical and thermal properties for industrial applications.
Yahaya, Shehu
core
An Adaptive Elephant Herd Optimization‐based Load Balancing Algorithm for energy efficient Networks
IET Networks, Accepted Article.Distributing resources among PCs, networks, and servers enables organizations to better manage their workloads and applications. The AEHO algorithm was used in this study to design a load‐balancing system. The elephant population is alienated into clans, with each point on the elephant's trunk denoting a different type of solution.
venkatasubramanian S +3 more
wiley +1 more source
Scheduling optimization of optical lens polishing
International Transactions in Operational Research, EarlyView.Abstract Optical systems have achieved notable progress in focusing and imaging technologies; however, manual grinding remains indispensable, resulting in elevated costs, extended timelines, and inefficiencies. These difficulties are compounded by operational constraints, uneven machine utilization, and risks of order delays and escalating expenses ...
Tzu‐Chin Lin, Bertrand M. T. Lin
wiley +1 more source
Efficient Algorithms for Scheduling Moldable Tasks
, 2021 We study the problem of scheduling $n$ independent moldable tasks on $m$ processors that arises in large-scale parallel computations. When tasks are monotonic, the best known result is a $(\frac{3}{2}+\epsilon)$-approximation algorithm for makespan ...
Loiseau, Patrick, Wu, Xiaohu
core
Survival and disinfection of SARS-Cov-2 in environment and contaminated surface [PDF]
, 2020 The detection of SARS-Cov-2 in the sewage and water resources has increased the awareness among the people about the possibility survival of SARS-Cov-2 in the environment and the potential to transmit into the human through food chain or water resources.
Al-Gheethi, Adel +5 more
core
NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness [PDF]
, 2015 Since Johnson׳s seminal paper in 1954, scheduling jobs in a permutation flowshop has been receiving the attention of hundreds of practitioners and researchers, being one of the most studied topics in the Operations Research literature.
Fernández-Viagas Escudero, Víctor +1 more
core +1 more source
International Transactions in Operational Research, Volume 33, Issue 3, Page 1525-1558, May 2026.Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge +3 more
wiley +1 more source
IEEE AccessIn healthcare, real-time decision making is crucial for ensuring timely and accurate patient care. However, traditional computing infrastructures, with their wide ranging capabilities, suffer from inherent latency, which compromises the efficiency of ...
Prashanth Choppara, Bommareddy Lokesh
doaj +1 more source