Synopsis
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.
"synopsis" may belong to another edition of this title.
Search results for A Multi-Agent Evolutionary Algorithm for Job Shop Scheduling...
Seller Image
A Multi-Agent Evolutionary Algorithm for Job Shop Scheduling with Operators
Published by
Scholars' Press Nov 2018, 2018
ISBN 10: 6202300310
ISBN 13: 9786202300315
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 9786202300315
Buy New
US$ 54.49
US$ 26.51 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
A Multi-Agent Evolutionary Algorithm for Job Shop Scheduling with Operators
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 261128738
Buy New
US$ 46.67
US$ 56.46 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Stock Image
A Multi-Agent Evolutionary Algorithm for Job Shop Scheduling with Operators
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 52 pages. 8.66x5.91x0.12 inches. In Stock. Seller Inventory # zk6202300310
Buy New
US$ 91.69
US$ 13.30 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
A Multi-Agent Evolutionary Algorithm for Job Shop Scheduling with Operators
Published by
Scholars' Press Nov 2018, 2018
ISBN 10: 6202300310
ISBN 13: 9786202300315
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 9786202300315
Buy New
US$ 54.49
US$ 69.14 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
A Multi-Agent Evolutionary Algorithm for Job Shop Scheduling with Operators
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 9786202300315
Buy New
US$ 55.13
US$ 69.70 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
A Multi-Agent Evolutionary Algorithm for Job Shop Scheduling with Operators
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 115130088
Buy New
US$ 47.78
US$ 80.67 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available