Abstract: An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important branch of production scheduling ...

Abstract: To meet the multi-cooperation production demand of enterprises, the distributed permutation flow shop scheduling problem (DPFSP) has become the frontier research in the field of ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...

Z. Zhao, G. Verma, C. Rao, A. Swami and S. Segarra, "Link Scheduling Using Graph Neural Networks," in IEEE Transactions on Wireless Communications, vol. 22, no. 6, pp. 3997-4012, June 2023, doi: ...

Secured Two Phase Geographic Greedy Forwarding (SecuTPGF) is a geographic greedy forwarding protocol for transmitting multimedia data stream in Wireless Multimedia Sensor Networks (WMSN) in a secure ...