Verwandte Artikel zu An Ant Colony Algorithm (ACA): for solving the new...
An Ant Colony Algorithm (ACA): for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs - Softcover
Reseña del editor
This paper concerns the Job Shop Scheduling Problem (JSSP) considering the transportation times of the jobs from one machine to another. The goal of a basic JSSP is to determine starting and ending times for each job in which the objective function can be optimized. In here, several Automated Guided Vehicles (AGVs) have been employed to transfer the jobs between machines and warehouse located at the production environment. Unlike the advantages of implemented automatic transportation system, if they are not controlled along the routes, it is possible that the production system encounters breakdown. Therefore, the Conflict-Free Routing Problem (CFRP) for AGVs is considered as well as the basic JSSP. Hence, we proposed a mathematical model which is composed of JSSP and CFRP, simultaneously and since the problem under study is NP-hard, a two stage Ant Colony Algorithm (ACA) is also proposed. The objective function is to minimize the total completion time (make-span).
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagLAP LAMBERT Academic Publishing
- Erscheinungsdatum2019
- ISBN 10 3330025840
- ISBN 13 9783330025844
- EinbandTapa blanda
- SpracheEnglisch
- Anzahl der Seiten52
Neu kaufen
Diesen Artikel anzeigen
EUR 39,90
EUR 23,00 für den Versand von Deutschland nach USA
Versandziele, Kosten & DauerSuchergebnisse für An Ant Colony Algorithm (ACA): for solving the new...
Foto des Verkäufers
An Ant Colony Algorithm (ACA)
Verlag:
LAP LAMBERT Academic Publishing Jan 2019, 2019
ISBN 10: 3330025840
ISBN 13: 9783330025844
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This paper concerns the Job Shop Scheduling Problem (JSSP) considering the transportation times of the jobs from one machine to another. The goal of a basic JSSP is to determine starting and ending times for each job in which the objective function can be optimized. In here, several Automated Guided Vehicles (AGVs) have been employed to transfer the jobs between machines and warehouse located at the production environment. Unlike the advantages of implemented automatic transportation system, if they are not controlled along the routes, it is possible that the production system encounters breakdown. Therefore, the Conflict-Free Routing Problem (CFRP) for AGVs is considered as well as the basic JSSP. Hence, we proposed a mathematical model which is composed of JSSP and CFRP, simultaneously and since the problem under study is NP-hard, a two stage Ant Colony Algorithm (ACA) is also proposed. The objective function is to minimize the total completion time (make-span). 52 pp. Englisch. Bestandsnummer des Verkäufers 9783330025844
Anzahl: 2 verfügbar
Foto des Verkäufers
An Ant Colony Algorithm (ACA) : for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs
Verlag:
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 3330025840
ISBN 13: 9783330025844
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This paper concerns the Job Shop Scheduling Problem (JSSP) considering the transportation times of the jobs from one machine to another. The goal of a basic JSSP is to determine starting and ending times for each job in which the objective function can be optimized. In here, several Automated Guided Vehicles (AGVs) have been employed to transfer the jobs between machines and warehouse located at the production environment. Unlike the advantages of implemented automatic transportation system, if they are not controlled along the routes, it is possible that the production system encounters breakdown. Therefore, the Conflict-Free Routing Problem (CFRP) for AGVs is considered as well as the basic JSSP. Hence, we proposed a mathematical model which is composed of JSSP and CFRP, simultaneously and since the problem under study is NP-hard, a two stage Ant Colony Algorithm (ACA) is also proposed. The objective function is to minimize the total completion time (make-span). Bestandsnummer des Verkäufers 9783330025844
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
An Ant Colony Algorithm (ACA) : for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs
Verlag:
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 3330025840
ISBN 13: 9783330025844
Gebraucht
Softcover
Anbieter: Buchpark, Trebbin, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: Sehr gut. Zustand: Sehr gut - Gepflegter, sauberer Zustand. | Seiten: 52 | Sprache: Englisch | Produktart: Bücher. Bestandsnummer des Verkäufers 33557506/2
Anzahl: 1 verfügbar
Foto des Verkäufers
An Ant Colony Algorithm (ACA)
Verlag:
LAP LAMBERT Academic Publishing, 2019
ISBN 10: 3330025840
ISBN 13: 9783330025844
Neu
Softcover
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Dehnavi-Arani SaeedPhd Candidate currently works at the Department of Industrial Engineering, Yazd University. Saeed. does research in Industrial Engineering. Their current project is role of AGVs in Cellular Manufacturing Systems . Bestandsnummer des Verkäufers 385646880
Anzahl: Mehr als 20 verfügbar