9783659237348 - order routing challenge in warehouse operations - an empirical study: a case study with reference to the perishable goods segment di vaddadi, krishna mohan; garimella, bhaskar narasimha rao (6 risultati)
- Brossura
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Come nuovo
EUR 121,19
EUR 29,13 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 196,00
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Order Routing Challenge in Warehouse Operations - An Empirical Study | A Case Study with reference to the Perishable Goods Segment | Krishna Mohan Vaddadi (u. a.) | Taschenbuch | 60 S. | Englisch | 2012 | LAP LAMBERT Academic Publishing | EAN 9783659237348 | Verantwortliche Person für die EU: preigu… GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,00
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In distribution logistics low-but-bulk quantity orders are being replaced by multiple-but-diminutive orders, which need to be executed in very tight time schedules. In manufacturing, there is a marked repositioning to lesser lot-si…zes, point-of-use delivery, and cycle time condensation. The order routing challenge (ORC) concerns the evaluation of how to knot orders and then to assign them to order-loaders. This research argues that efficiency can increase in the order loading process in such environments by catering to a group of orders instead of exclusive orders. The essential issue is, hence, to determine the set of orders the order-loader should serve in one trip to minimize the mean throughput time of a random order. This research focus on the derivation of a simple but efficient algorithm for the establishment of an optimal load batch size for order-loaders in a typical Twin-block warehouse. Moments are defined applied to approximate the waiting duration of a random order based on the analogous batch service queuing structure. The optimal order batch size is then established in a straightforward pattern. 60 pp. Englisch.
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,00
EUR 30,50 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In distribution logistics low-but-bulk quantity orders are being replaced by multiple-but-diminutive orders, which need to be executed in very tight time schedules. In manufacturing, there is a marked repositioning to lesser lot-sizes,…point-of-use delivery, and cycle time condensation. The order routing challenge (ORC) concerns the evaluation of how to knot orders and then to assign them to order-loaders. This research argues that efficiency can increase in the order loading process in such environments by catering to a group of orders instead of exclusive orders. The essential issue is, hence, to determine the set of orders the order-loader should serve in one trip to minimize the mean throughput time of a random order. This research focus on the derivation of a simple but efficient algorithm for the establishment of an optimal load batch size for order-loaders in a typical Twin-block warehouse. Moments are defined applied to approximate the waiting duration of a random order based on the analogous batch service queuing structure. The optimal order batch size is then established in a straightforward pattern.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 41,67
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Vaddadi Krishna MohanDr V. Krishna Mohan is a Professor in DCMS, Andhra University, Visakhapatnam with 26 years experience and has published 5 books, 86 research papers and guided 62 doctoral students.… He is serving as Registrar (on .
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 196,00
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In distribution logistics low-but-bulk quantity orders are being replaced by multiple-but-diminutive orders, which need to be executed in very tight time schedules. In manufacturing, there is a marked repositioning to lesser lot-sizes,… point-of-use delivery, and cycle time condensation. The order routing challenge (ORC) concerns the evaluation of how to knot orders and then to assign them to order-loaders. This research argues that efficiency can increase in the order loading process in such environments by catering to a group of orders instead of exclusive orders. The essential issue is, hence, to determine the set of orders the order-loader should serve in one trip to minimize the mean throughput time of a random order. This research focus on the derivation of a simple but efficient algorithm for the establishment of an optimal load batch size for order-loaders in a typical Twin-block warehouse. Moments are defined applied to approximate the waiting duration of a random order based on the analogous batch service queuing structure. The optimal order batch size is then established in a straightforward pattern.OmniScriptum SRL, Str. Armeneasca 28/1, office 1, 2012 Chisinau 60 pp. Englisch.
