OPTIMAL DELIVERY TIME QUOTATION AND ORDER SEQUENCING

被引：42

作者：

DE, P

GHOSH, JB

WELLS, CE

机构：

[1] Department of MIS & Decision Sciences, School of Business Administration, University of Dayton, Dayton, Ohio

来源：

DECISION SCIENCES | 1991年 / 22卷 / 02期

关键词：

MATHEMATICAL PROGRAMMING; PRODUCTION/OPERATIONS MANAGEMENT; SCHEDULING;

D O I：

10.1111/j.1540-5915.1991.tb00353.x

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper examines the problem of quoting a common delivery time for several orders. The decision maker responsible for the quote must trade off the cost associated with a long delivery time against the cost of tardy orders that might be induced by a short delivery time. First, an aggregate cost model is investigated where it is assumed that some cost is incurred if the quoted delivery time exceeds a given threshold and the cost of order tardiness is dependent on the order. Both exact and heuristic solution procedures are proposed for this model. Finally, for the situation where the costs cannot be quantified, a bicriteria formulation of the problem is pursued and the set of nondominated solutions is identified. Copyright © 1991, Wiley Blackwell. All rights reserved

引用

页码：379 / 390

页数：12

共 26 条

[11]

CONWAY RW, 1965, J IND ENGINEERING, V16, P228

[12]

Eilon S., 1976, International Journal of Production Research, V14, P223, DOI 10.1080/00207547608956596

[13]

French S., 1983, MULTIOBJECTIVE DECIS

[14]

GUPTA SK, 1987, OMEGA-INT J MANAGE S, V15, P207, DOI 10.1016/0305-0483(87)90071-5

[15] ECONOMIC EVALUATION OF JOB SHOP DISPATCHING RULES [J].

JONES, CH .

MANAGEMENT SCIENCE SERIES A-THEORY, 1973, 20 (03) :293-307

[16]

MARTELLO S, 1979, COMBINATORIAL OPTIMI

[17] AN IMPROVED DIRECT DESCENT ALGORITHM FOR BINARY KNAPSACK-PROBLEMS [J].

MURPHY, RA .

COMPUTERS & OPERATIONS RESEARCH, 1989, 16 (04) :305-313

[18] EFFICIENT ALGORITHM FOR 0-1 KNAPSACK PROBLEM [J].

NAUSS, RM .

MANAGEMENT SCIENCE, 1976, 23 (01) :27-31

[19] COMMON DUE DATE ASSIGNMENT TO MINIMIZE TOTAL PENALTY FOR THE ONE MACHINE SCHEDULING PROBLEM [J].

PANWALKAR, SS ;

SMITH, ML ;

SEIDMANN, A .

OPERATIONS RESEARCH, 1982, 30 (02) :391-399

[20]

Papadimitriou C. H., 1998, COMBINATORIAL OPTIMI

← 1 2 3 →