Order Routing Challenge in Warehouse Operations - An Empirical Study: A Case Study with reference to the Perishable Goods Segment

 
9783659237348: Order Routing Challenge in Warehouse Operations - An Empirical Study: A Case Study with reference to the Perishable Goods Segment
View all copies of this ISBN edition:
 
 

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.

"synopsis" may belong to another edition of this title.

About the Author:

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.

"About this title" may belong to another edition of this title.

Buy New View Book
List Price: US$ 63.00
US$ 46.48

Convert currency

Shipping: US$ 9.86
From United Kingdom to U.S.A.

Destination, rates & speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Krishna Mohan Vaddadi (author)
Published by LAP Lambert Academic Publishing 2012-09-11 (2012)
ISBN 10: 3659237345 ISBN 13: 9783659237348
New paperback Quantity Available: > 20
Seller:
Blackwell's
(Oxford, OX, United Kingdom)
Rating
[?]

Book Description LAP Lambert Academic Publishing 2012-09-11, 2012. paperback. Condition: New. Seller Inventory # 9783659237348

More information about this seller | Contact this seller

Buy New
US$ 46.48
Convert currency

Add to Basket

Shipping: US$ 9.86
From United Kingdom to U.S.A.
Destination, rates & speeds

2.

Vaddadi, Krishna Mohan / Garimella, Bhaskar Narasimha Rao
ISBN 10: 3659237345 ISBN 13: 9783659237348
New Quantity Available: 1
Seller:
Rating
[?]

Book Description Condition: New. Publisher/Verlag: LAP Lambert Academic Publishing | A Case Study with reference to the Perishable Goods Segment | 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. | Format: Paperback | Language/Sprache: english | 60 pp. Seller Inventory # K9783659237348

More information about this seller | Contact this seller

Buy New
US$ 53.91
Convert currency

Add to Basket

Shipping: US$ 3.21
From Germany to U.S.A.
Destination, rates & speeds

3.

Krishna Mohan Vaddadi
Published by LAP Lambert Academic Publishing (2012)
ISBN 10: 3659237345 ISBN 13: 9783659237348
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description LAP Lambert Academic Publishing, 2012. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # LQ-9783659237348

More information about this seller | Contact this seller

Buy New
US$ 50.38
Convert currency

Add to Basket

Shipping: US$ 11.83
From United Kingdom to U.S.A.
Destination, rates & speeds

4.

Krishna Mohan Vaddadi
Published by LAP Lambert Academic Publishing (2012)
ISBN 10: 3659237345 ISBN 13: 9783659237348
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description LAP Lambert Academic Publishing, 2012. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9783659237348

More information about this seller | Contact this seller

Buy New
US$ 59.42
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

5.

Krishna Mohan Vaddadi
Published by LAP Lambert Academic Publishing Sep 2012 (2012)
ISBN 10: 3659237345 ISBN 13: 9783659237348
New Taschenbuch Quantity Available: 1
Seller:
BuchWeltWeit Inh. Ludwig Meier e.K.
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description LAP Lambert Academic Publishing Sep 2012, 2012. Taschenbuch. Condition: 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. 60 pp. Englisch. Seller Inventory # 9783659237348

More information about this seller | Contact this seller

Buy New
US$ 58.89
Convert currency

Add to Basket

Shipping: US$ 19.99
From Germany to U.S.A.
Destination, rates & speeds

6.

Krishna Mohan Vaddadi
Published by LAP Lambert Academic Publishing Sep 2012 (2012)
ISBN 10: 3659237345 ISBN 13: 9783659237348
New Taschenbuch Quantity Available: 1
Seller:
Rheinberg-Buch
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description LAP Lambert Academic Publishing Sep 2012, 2012. Taschenbuch. Condition: 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. 60 pp. Englisch. Seller Inventory # 9783659237348

More information about this seller | Contact this seller

Buy New
US$ 58.89
Convert currency

Add to Basket

Shipping: US$ 19.99
From Germany to U.S.A.
Destination, rates & speeds

7.

Krishna Mohan Vaddadi
Published by LAP Lambert Academic Publishing
ISBN 10: 3659237345 ISBN 13: 9783659237348
New Paperback Quantity Available: > 20
Seller:
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Rating
[?]

Book Description LAP Lambert Academic Publishing. Paperback. Condition: New. 60 pages. Dimensions: 8.7in. x 5.9in. x 0.1in.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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Seller Inventory # 9783659237348

More information about this seller | Contact this seller

Buy New
US$ 86.75
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds

8.

Krishna Mohan Vaddadi
Published by LAP Lambert Academic Publishing, Germany (2012)
ISBN 10: 3659237345 ISBN 13: 9783659237348
New Paperback Quantity Available: 10
Print on Demand
Seller:
The Book Depository EURO
(London, United Kingdom)
Rating
[?]

Book Description LAP Lambert Academic Publishing, Germany, 2012. Paperback. Condition: New. Aufl.. Language: English . Brand New Book ***** Print on Demand *****.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. Seller Inventory # AAV9783659237348

More information about this seller | Contact this seller

Buy New
US$ 84.43
Convert currency

Add to Basket

Shipping: US$ 3.94
From United Kingdom to U.S.A.
Destination, rates & speeds

9.

Krishna Mohan Vaddadi
Published by LAP Lambert Academic Publishing Sep 2012 (2012)
ISBN 10: 3659237345 ISBN 13: 9783659237348
New Taschenbuch Quantity Available: 1
Print on Demand
Seller:
AHA-BUCH GmbH
(Einbeck, Germany)
Rating
[?]

Book Description LAP Lambert Academic Publishing Sep 2012, 2012. Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand 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. Seller Inventory # 9783659237348

More information about this seller | Contact this seller

Buy New
US$ 58.89
Convert currency

Add to Basket

Shipping: US$ 34.42
From Germany to U.S.A.
Destination, rates & speeds