Premium
Cyclical schedules for the joint replenishment problem with dynamic demands
Author(s) -
Webb Ian R.,
Buzby Bruce R.,
Campbell Gerard M.
Publication year - 1997
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199709)44:6<577::aid-nav4>3.0.co;2-0
Subject(s) - time horizon , production (economics) , computer science , operations research , schedule , scheduling (production processes) , joint (building) , operations management , mathematical optimization , economics , microeconomics , mathematics , engineering , architectural engineering , operating system
The Joint Replenishment Problem (JRP) involves production planning for a family of items. The items have a coordinated cost structure whereby a major setup cost is incurred whenever any item in the family is produced, and an item‐specific minor setup cost is incurred whenever that item is produced. This paper investigates the performance of two types of cyclical production schedules for the JRP with dynamic demands over a finite planning horizon. The cyclical schedules considered are: (1) general cyclical schedules—schedules where the number of periods between successive production runs for any item is constant over the planning horizon—and (2) power‐of‐two schedules—a subset of cyclical schedules for which the number of periods between successive setups must be a power of 2. The paper evaluates the additional cost incurred by requiring schedules to be cyclical, and identifies problem characteristics that have a significant effect on this additional cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 577–589, 1997.