An Ant Colony Algorithm (ACA) - 5 Angebote vergleichen
Bester Preis: Fr. 33.34 (€ 34.09)¹ (vom 02.05.2019)1
An Ant Colony Algorithm (ACA)
~EN NWISBN: 9783330025844 bzw. 3330025840, vermutlich in Englisch, neu.
Lieferung aus: Vereinigtes Königreich Grossbritannien und Nordirland, Lieferzeit: 11 Tage, zzgl. Versandkosten.
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).
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).
2
An Ant Colony Algorithm (ACA) - for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs
~EN PB NWISBN: 9783330025844 bzw. 3330025840, vermutlich in Englisch, LAP Lambert Academic Publishing, Taschenbuch, neu.
Lieferung aus: Deutschland, Versandkostenfrei.
An Ant Colony Algorithm (ACA): 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). Englisch, Taschenbuch.
An Ant Colony Algorithm (ACA): 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). Englisch, Taschenbuch.
3
An Ant Colony Algorithm (ACA)
~EN PB NWISBN: 3330025840 bzw. 9783330025844, vermutlich in Englisch, LAP Lambert Academic Publishing, Taschenbuch, neu.
An Ant Colony Algorithm (ACA) ab 39.9 € als Taschenbuch: for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs. Aus dem Bereich: Bücher, Wissenschaft, Technik,.
5
An Ant Colony Algorithm (
~EN PB NWISBN: 9783330025844 bzw. 3330025840, vermutlich in Englisch, Taschenbuch, neu.
Lieferung aus: Deutschland, Next Day, Versandkostenfrei.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…