Výsledky vyhľadávania - "greedy algorithm"

Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization Autor Tang, Zhongzheng, Chen, Jingwen, Wang, Chenhao

Získať plný text

A two-stage iterated greedy algorithm for distributed blocking flowshop scheduling problem Autor Zhang, Sen, Qian, Bin, Hu, Rong, Li, Kun, Yang, Jian-Bo

“…This paper deals with the distributed blocking flowshop scheduling problem (DBFSP), a critical challenge in modern manufacturing systems involving multiple…”
Získať plný text

Biorthogonal Greedy Algorithms in convex optimization Autor Dereventsov, A.V., Temlyakov, V.N.

“…The study of greedy approximation in the context of convex optimization is becoming a promising research direction as greedy algorithms are actively being…”
Získať plný text

A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop Autor Lu, Chao, Liu, Qiao, Zhang, Biao, Yin, Lvjiang

“…Due to its practicality, hybrid flowshop scheduling problem (HFSP) with productivity objective has been extensively explored. However, studies on HFSP…”
Získať plný text

An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem Autor Huang, Ying-Ying, Pan, Quan-Ke, Huang, Jiang-Ping, Suganthan, PN, Gao, Liang

“…•We study a distributed assembly permutation flowshop scheduling problem.•We propose an improved iterative greedy algorithm based on group thinking.•A…”
Získať plný text

Data-driven traffic sensor location and path flow estimation using Wasserstein metric Autor Gao, Jiaqi, Yang, Kai, Shen, Mengru, Yang, Lixing

“…This paper introduces link information value obtained by the traffic sensors and presents a traffic sensor location and flow estimation joint optimization…”
Získať plný text

Iterated greedy algorithm with constraint programming for scheduling steelmaking-continuous casting process Autor Kim, Dongyun, Choi, Yeonjun, Moon, Kyungduk, Lee, Myungho, Lee, Kangbok, Pinedo, Michael

Získať plný text

Covering segments on a line with drones Autor Bereg, Sergey, Díaz-Báñez, José-Miguel, Kasiuk, Alina, Pérez-Cutiño, Miguel-Angel, Rodríguez, Fabio

Získať plný text

Finding the minimum k-weighted dominating sets using heuristic algorithms Autor Barrena, E., Bermudo, S., Hernández-Díaz, A.G., López-Sánchez, A.D., Zamudio, J.A.

“…In this work, we propose, analyze, and solve a generalization of the k-dominating set problem in a graph, when we consider a weighted graph. Given a graph with…”
Získať plný text

Mathematical model and knowledge-based iterated greedy algorithm for distributed assembly hybrid flow shop scheduling problem with dual-resource constraints Autor Yu, Fei, Lu, Chao, Zhou, Jiajun, Yin, Lvjiang

Získať plný text

An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem Autor Qin, Hao-Xiang, Han, Yu-Yan, Zhang, Biao, Meng, Lei-Lei, Liu, Yi-Ping, Pan, Quan-Ke, Gong, Dun-Wei

“…•A mathematical model of a blocking hybrid flow shop scheduling problem with energy consumption criteria is proposed.•A simple global perturbation based on a…”
Získať plný text

An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop Autor Zou, Wen-Qiang, Pan, Quan-Ke, Tasgetiren, M. Fatih

“…In this paper, we address a multi-compartment automatic guided vehicle scheduling (MC-AGVS) problem from a matrix manufacturing workshop that has attracted…”
Získať plný text

Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem Autor Qin, Haoxiang, Han, Yuyan, Wang, Yuting, Liu, Yiping, Li, Junqing, Pan, Quanke

“…This paper introduces a new flow shop combinatorial optimization problem, called the blocking hybrid flow shop group scheduling problem (BHFGSP). In the…”
Získať plný text

An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times Autor Huang, Jiang-Ping, Pan, Quan-Ke, Gao, Liang

“…The distributed permutation flowshop scheduling problem (DPFSP) has attracted much attention in recent years. In this paper, we extend the DPFSP by considering…”
Získať plný text

Minimising makespan in distributed mixed no-idle flowshops Autor Cheng, Chen-Yang, Ying, Kuo-Ching, Chen, Hsia-Hsiang, Lu, Hsiao-Shan

“…The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed…”
Získať plný text

Deadline-aware and energy-efficient IoT task scheduling in fog computing systems: A semi-greedy approach Autor Azizi, Sadoon, Shojafar, Mohammad, Abawajy, Jemal, Buyya, Rajkumar

“…With the rapid advancement of Internet of Things (IoT) devices, a variety of IoT applications that require a real-time response and low latency have emerged…”
Získať plný text

Greedy-based approach for generating anisotropic random fiber distributions of unidirectional composites and transverse mechanical properties prediction Autor Li, Mengze, Zhang, Haowei, Ma, Jiahe, Li, Shuran, Zhu, Weidong, Ke, Yinglin

“…[Display omitted] •A novel greedy-based algorithm is proposed to generate random fiber distributions.•The generated anisotropic RVEs are statistically…”
Získať plný text

Influence maximization algorithm based on Gaussian propagation model Autor Li, WeiMin, Li, Zheng, Luvembe, Alex Munyole, Yang, Chao

“…•A Gaussian propagation model is explored to improve Influence Maximization.•Multi-dimensional space modeling is constructed by offset, motif, and degree…”
Získať plný text

gLaSDI: Parametric physics-informed greedy latent space dynamics identification Autor He, Xiaolong, Choi, Youngsoo, Fries, William D., Belof, Jonathan L., Chen, Jiun-Shyan

“…A parametric adaptive physics-informed greedy Latent Space Dynamics Identification (gLaSDI) method is proposed for accurate, efficient, and robust data-driven…”
Získať plný text

The thresholding greedy algorithm versus approximations with sizes bounded by certain functions f Autor Chu, Hùng Việt

“…Let X be a Banach space and (en)n=1∞ be a basis. For a function f in a large collection F (closed under composition), we define and characterize f-greedy and…”
Získať plný text