摘要:

Unit discounts from suppliers and freight discounts from shippers are commonly encountered phenomenons. This paper develops and demonstrates optimal inventory/transport decision support algorithms for these dual discount situations. Quantity discounts and freight discounts are modeled to reveal optimal combinatorial strategies.

ISSN:0740-817X    

DOI:10.1080/07408179408966600

出版商:Taylor & Francis Group    

年代:1994

数据来源: Taylor

摘要:

A common procedure in budget allocation is to let the different entities of an organization determine their optimal budgets. Once the individual requests are received, they are then cut by a common factor, as necessary, so that a global constraint is satisfied. We refer to this procedure as the “cut across the board” rule. In general, this method will not result in a globally optimal solution. In this paper we identify conditions that assure the global optimality of die “cut (or expand) across the board” rule. We specifically focus on a constrained multi-item inventory model and generalize results of Rosenblatt [10] and Plossl and Wight [8]. In addition, we briefly discuss applicability of the results to other areas.

ISSN:0740-817X    

DOI:10.1080/07408179408966601

出版商:Taylor & Francis Group    

年代:1994

数据来源: Taylor

摘要:

We consider a hierarchical multiple criteria scheduling problem on parallel-machines. The jobs are divided intoppriority classes and the total flowtime of die class with thek-th highest priority is thek-th highest objective criterion. We show that the optimal schedule can be constructed by a generalized shortest processing time (SPT) rule.

ISSN:0740-817X    

DOI:10.1080/07408179408966602

出版商:Taylor & Francis Group    

年代:1994

数据来源: Taylor