Daniel Cesar Cuche Cartagena (7 results)

Condition: New.

Paperback. Condition: Brand New. 52 pages. 8.66x5.91x0.12 inches. In Stock.

Taschenbuch. Condition: Neu. A Multi-Agent Evolutionary Algorithm for Job Shop Scheduling with Operators | Daniel Cesar Cuche Cartagena | Taschenbuch | 52 S. | Englisch | 2018 | Scholars' Press | EAN 9786202300315 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This study considers the job shop scheduling problem in which processing of an operation on a given machine has to be assisted by one of a limited number of operators, called job shop scheduling with operators. In this problem, besides determining the sequence of the jobs assigned to each machine, it is also needed to assign the jobs to operators and determine the sequence of the jobs assigned to each operator. After representing the problem using an extended disjunctive graph and providing an integer programming model for the objective of minimizing makespan, I suggest a multi-agent evolutionary algorithm that incorporates a new neighborhood generation method. To test the performance of the algorithm suggested in this study, computational experiments were done on benchmark instances, and the results show that the algorithm gives better solutions than the current best ones for the test instances in which the number of operators is up to around a half of the number of machines. In particular, the proposed algorithm gave the optimal solutions for most test instances with smaller number of operators. 52 pp. Englisch.

Condition: New. PRINT ON DEMAND.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This study considers the job shop scheduling problem in which processing of an operation on a given machine has to be assisted by one of a limited number of operators, called job shop scheduling with operators. In this problem, besides determining the sequence of the jobs assigned to each machine, it is also needed to assign the jobs to operators and determine the sequence of the jobs assigned to each operator. After representing the problem using an extended disjunctive graph and providing an integer programming model for the objective of minimizing makespan, I suggest a multi-agent evolutionary algorithm that incorporates a new neighborhood generation method. To test the performance of the algorithm suggested in this study, computational experiments were done on benchmark instances, and the results show that the algorithm gives better solutions than the current best ones for the test instances in which the number of operators is up to around a half of the number of machines. In particular, the proposed algorithm gave the optimal solutions for most test instances with smaller number of operators.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 52 pp. Englisch.

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This study considers the job shop scheduling problem in which processing of an operation on a given machine has to be assisted by one of a limited number of operators, called job shop scheduling with operators. In this problem, besides determining the sequence of the jobs assigned to each machine, it is also needed to assign the jobs to operators and determine the sequence of the jobs assigned to each operator. After representing the problem using an extended disjunctive graph and providing an integer programming model for the objective of minimizing makespan, I suggest a multi-agent evolutionary algorithm that incorporates a new neighborhood generation method. To test the performance of the algorithm suggested in this study, computational experiments were done on benchmark instances, and the results show that the algorithm gives better solutions than the current best ones for the test instances in which the number of operators is up to around a half of the number of machines. In particular, the proposed algorithm gave the optimal solutions for most test instances with smaller number of operators.