Non-monetary coordination mechanisms for time slot allocation in warehouse delivery

Karaenke, Paul; Bichler, Martin; Merting, Soeren; Minner, Stefan

doi:10.1016/j.ejor.2020.03.068

Cited by 13 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After optimization, the total time to complete the material picking process is 9:31, which represents a significant saving compared to the original time of 10:20. The optimal storage of material items in shelving positions according to categories is 17,19,18,14,6,27,3,32,8,1,28,22,7,33,29,5,21,26,15,13,16,11,25,23,34,10,9,20,2,24,12,31,30,4. In this order, the individual categories of material items should be placed in the racking positions.…”

Section: Resultsmentioning

confidence: 99%

“…But these authors did not solve this problem about the influence of the position of storing a goods item in a warehouse on speeding up the picking process. Another similar work [27] deals with the coordination of supply routes which was solved in terms of reducing time for picking of goods. This approach is not possible to apply for the described paper because the paper considers the supply of AGF sets which have nicely defined transport routes and they cannot be changed.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

The Use of a Simulation Model for High-Runner Strategy Implementation in Warehouse Logistics

2020

View full text Add to dashboard Cite

This paper examines the use of computer simulation methods to streamline the process of picking materials within warehouse logistics. The article describes the use of a genetic algorithm to optimize the storage of materials in shelving positions, in accordance with the method of High-Runner Strategy. The goal is to minimize the time needed for picking. The presented procedure enables the creation of a software tool in the form of an optimization model that can be used for the needs of the optimization of warehouse logistics processes within various types of production processes. There is a defined optimization problem in the form of a resistance function, which is of general validity. The optimization is represented using the example of 400 types of material items in 34 categories, stored in six rack rows. Using a simulation model, a comparison of a normal and an optimized state is realized, while a time saving of 48 min 36 s is achieved. The mentioned saving was achieved within one working day. However, the application of an approach based on the use of optimization using a genetic algorithm is not limited by the number of material items or the number of categories and shelves. The acquired knowledge demonstrates the application possibilities of the genetic algorithm method, even for the lowest levels of enterprise logistics, where the application of this approach is not yet a matter of course but, rather, a rarity.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

The Use of a Simulation Model for High-Runner Strategy Implementation in Warehouse Logistics

2020

View full text Add to dashboard Cite

show abstract

“…RESPCT is a versatile tool for one-tomany object assignments without monetary transfers and a powerful means for the design of distributed information systems. The unit demand assumption in assignment problems is the most severe but also the most challenging limitation, one that is currently drawing significant attention (Budish and Cantillon 2012, Nguyen et al 2016, Karaenke et al 2020, as it would considerably extend the number of applications for matching with preferences.…”

Section: Discussionmentioning

confidence: 99%

How to Assign Scarce Resources Without Money: Designing Information Systems that are Efficient, Truthful, and (Pretty) Fair

Bichler

Hammerl

Morrill

et al. 2021

Information Systems Research

Self Cite

View full text Add to dashboard Cite

Matching with preferences has great potential to coordinate the efficient allocation of scarce resources in organizations when monetary transfers are not available. It is well known that it is impossible to combine all three properties of truthfulness, efficiency, and fairness (i.e., envy freeness) in matching with preferences. Established mechanisms are either efficient or envy free, and the efficiency loss in envy-free mechanisms is substantial. We focus on a widespread representative of a matching problem: course assignment where students have preferences for courses and organizers have priorities over students. An important feature in course assignment is that a course has a maximum capacity and a minimum required quota. This is also a requirement in many other matching applications, such as school choice, hospital-residents matching, or the assignment of workers to jobs. We introduce RESPCT, a mechanism that respects minimum quotas and is truthful, efficient, and has low levels of envy. The reduction in envy is significant and is due to two remarkably effective heuristics. We provide analytical and experimental results based on field data from a large-scale course assignment application. These results have led to a policy change and the proposed assignment system is now being used to match hundreds of students every semester.

show abstract

“…Warehouse logistic operations need to be smooth, without unnecessary delays at the truck check-in, (un) loading, and check-out points [46]. Unfortunately, research shows that warehouse operations endure an absence of coordination and individual carriers fail to optimize their delivery schedules, causing long delays and increasing waiting hours [47]. Such inefficiencies directly impact supply chains performance, both in terms of costs and environmental effects.…”

Section: A Focus On Cloud-based Collaborative Platformsmentioning

confidence: 99%

Cloud-Based Booking Platforms in Warehouse Operations

Giuffrida¹

2021

Sustainability

View full text Add to dashboard Cite

This study evaluates the implementation costs of cloud-based booking platforms (CBBPs) to manage vehicle queues in warehouses and investigates how cloud-based booking platforms support inter-organizational logistics processes. To understand the impact of CBBPs, we interviewed logistics managers concerning the structure of the CBBP processes, salient platform features, and their effects on inter-organizational dynamics. In addition, we conducted an analytical modeling simulation to compute the economic impact of each investment scenario. Our results show that CBBP benefits, and their financial viability, are sensitive to the size of a company and the selected decision driver (cost vs. time optimization). Hence, our findings challenge the standard view that adopting digital technologies in inter-organizational settings is an easy task.

show abstract

Non-monetary coordination mechanisms for time slot allocation in warehouse delivery

Cited by 13 publications

References 21 publications

The Use of a Simulation Model for High-Runner Strategy Implementation in Warehouse Logistics

The Use of a Simulation Model for High-Runner Strategy Implementation in Warehouse Logistics

How to Assign Scarce Resources Without Money: Designing Information Systems that are Efficient, Truthful, and (Pretty) Fair

Cloud-Based Booking Platforms in Warehouse Operations

Contact Info

Product

Resources

About