Routing and dispatching of multiple mobile agents in integratedenterprises

Elalouf, Amir; Levner, Eugene; Cheng, T.C.E.

doi:10.1016/j.ijpe.2013.01.003

Cited by 10 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach to constructing a new FPTAS for the MIN-JSDP follows a computational scheme that we recently developed for solving the restricted shortest path problem (see [1,11]). The algorithm consists of three main stages:…”

Section: A New Fptas Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Improving the solution complexity of the scheduling problem with deadlines: A general technique

Elalouf

Levner

2016

RAIRO-Oper. Res.

View full text Add to dashboard Cite

The aim of this paper is to develop improved polynomial-time approximation algorithms belonging to the family of the fully polynomial time approximation schemes (FPTAS) for a group of scheduling problems. In particular, the new technique provides a positive answer to a question posed more than three decades ago by Gens and Levner [G.V. Gens and E.V. Levner, Discrete Appl. Math. 3 (1981) 313-318]: "Can an epsilon-approximation algorithm be found for the minimization version of the job-sequencing-with-deadlines problem running with the same complexity as the algorithms for the maximization form of the problem?"

show abstract

Section: A New Fptas Algorithmmentioning

confidence: 99%

“…It is easy to see, that the suggested technique permits to reduce the FPTAS complexity to O(mn/ ). The interested reader can find further details in Levner et al [11] and Elalouf et al [1].…”

Section: Example 1 ([7]mentioning

confidence: 99%

Improving the solution complexity of the scheduling problem with deadlines: A general technique

Elalouf

Levner

2016

RAIRO-Oper. Res.

View full text Add to dashboard Cite

show abstract

“…Related to scheduling manufacturing problems, multi‐agents show good to solve combinatorial NP‐hard problems . Same, and more recently, supply chain and logistics have been addressed by agents .…”

Section: Related Workmentioning

confidence: 99%

Applying Gaia and AUML for the development of multiagent‐based control software for flexible manufacturing systems: addressing methodological and implementation issues

2015

View full text Add to dashboard Cite

SUMMARYIn this article, we present the development of a simple multiagent-based system for the control of a flexible manufacturing system. We followed the stages of a methodology specially conceived for the development of agent-based system, which is an integration of the classical methodology for agent-oriented analysis and design Gaia, and AUML (Agent-Unified Modeling Language). We adopted as study case the CIMUBB Laboratory at the University of Bio-Bio, which has a flexible manufacturing system including three flexible manufacturing cells interconnected by a conveyor belt. In the analysis stage, we identified roles involved, and we design models representing roles and protocols. In the design stage, we applied Gaia agent, services, and acquaintance models from Gaia, and we complemented with AUML as the adopted methodology suggests.With the developed models, we constructed a fully functional system where each agent was built as an independent process tree. Agents communicate by passing messages through the Ethernet network with socket interfaces. Various tests executed in our laboratory scale manufacturing system show the effectiveness of our implementation.

show abstract

“…In the first paper in this category, Elalouf et al (2013) propose an agent-based approach to design and implement enterprise collaboration. They develop a fast two-stage approximation algorithm for the routing-and-dispatching problem, which extends an earlier computational scheme in the literature for finding resource-constrained extremal paths in a graph.…”

Section: Computational Intelligence In Logistics Systemsmentioning

confidence: 99%