INFORMS Journal on Computing
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


INFORMS JOURNAL ON COMPUTING
Vol. 20, No. 1, Winter 2008, pp. 78-85
DOI: 10.1287/ijoc.1070.0219
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Bai, R.
Right arrow Articles by Kendall, G.
Right arrow Search for Related Content

A Model for Fresh Produce Shelf-Space Allocation and Inventory Management with Freshness-Condition-Dependent Demand

Ruibin Bai, Graham Kendall

Automated Scheduling, Optimisation and Planning (ASAP) Research Group, Division of Computer Science, The University of Nottingham, Ningbo 315100, China
School of Computer Science, University of Nottingham, Nottingham NG8 1BB, United Kingdom

ruibin.bai{at}nottingham.edu.cn
gxk{at}cs.nott.ac.uk

Asignificant amount of work has investigated inventory control problems associated with fresh produce. Much of this work has considered deteriorating inventory control with many models having been proposed for various situations. However, no researchers have specifically studied fresh produce, which has its own special characteristics. Most research categorizes fresh produce into more general deteriorating categories with random lifetimes and nondecaying utilities. However, this classification is not reasonable or practical because the freshness of an item usually plays an important role in influencing the demand for the produce. In this paper, a single-period inventory and shelf-space allocation model is proposed for fresh produce. These items usually have a very short lifetime. The demand rate is assumed to be deterministic and dependent on both the displayed inventory (the number of facings of items on the shelves) and the items' freshness condition (which decreases over time). Several problem instances of different sizes are provided and solved by a modified generalized reduced gradient algorithm.

Key words: inventory; shelf-space allocation; fresh produce; optimization
History: received December 2004; revised July 2005; accepted December 2006.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2008 by INFORMS.