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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Dr 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 deputation) of Dr B.R.Ambedkar University, Srikakulam,AP, India on deputation and research interests are SCM and Marketing Econometrics.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: 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-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. 60 pp. Englisch. Bestandsnummer des Verkäufers 9783659237348
Anzahl: 2 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: 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 . Bestandsnummer des Verkäufers 5142041
Anzahl: Mehr als 20 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. 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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 60 pp. Englisch. Bestandsnummer des Verkäufers 9783659237348
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783659237348
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: 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: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. Bestandsnummer des Verkäufers 106296609
Anzahl: 5 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Bestandsnummer des Verkäufers ERICA80036592373456
Anzahl: 1 verfügbar