Multi agent evolutionary algorithm job von cuche cartagena (9 Ergebnisse)
- Softcover
Anbieter: Books Puddle, New York, NY, USABooks Puddle
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 73,25
EUR 3,49 VersandVersand innerhalb von USAAnzahl: 4 verfügbar
Zustand: New.
- Softcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 80,47
EUR 11,68 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Paperback. Zustand: Brand New. 52 pages. 8.66x5.91x0.12 inches. In Stock.
- Softcover
Anbieter: moluna, Greven, Deutschlandmoluna
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 39,32
EUR 48,99 VersandVersand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New.
- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 40,25
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: 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[do…t]de | Anbieter: preigu.
- Softcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 45,90
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: 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, beside…s 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.
- Softcover
- Print-on-Demand
Anbieter: Majestic Books, Hounslow, Vereinigtes KönigreichMajestic Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 74,07
EUR 7,59 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
Zustand: New. Print on Demand.
- Softcover
- Print-on-Demand
Anbieter: Biblios, frankfurt am main, HESSE, DeutschlandBiblios
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 74,73
EUR 9,95 VersandVersand von Deutschland nach USAAnzahl: 4 verfügbar
Zustand: New. PRINT ON DEMAND.
- Softcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 45,90
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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 de…termining 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.
- Softcover
- Print-on-Demand
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 46,45
EUR 60,48 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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 det…ermining 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.
