SCHEDULING OF STORAGE-RETRIEVAL ORDERS UNDER A JUST-IN-TIME ENVIRONMENT

被引：13

作者：

LEE, MK

KIM, SY

机构：

[1] Department of Industrial Engineering, Keimyung University, Taegu, 704-701

[2] Department of Industrial Engineering, Pohang University of Science and Technology, Pohang

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1995年 / 33卷 / 12期

关键词：

D O I：

10.1080/00207549508904877

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider the problem of scheduling storage and retrieval orders under dual-command operations in a unit-load automated storage/retrieval system. The objective is to minimize the weighted sum of earliness and tardiness penalties about a common due date. We propose four heuristics based upon a two-step approach where dual-command cycles are formed first and then optimally scheduled. A mixed-integer programming model is also formulated to obtain an optimal solution. Performances of the heuristics are compared in the simulation tests. Computational results show that some heuristics perform favourably.

引用

页码：3331 / 3348

页数：18

共 18 条

[1]

Bagchi U., Chang Y., Sullivan R., Minimizing absolute and squared deviations for completion limes with different earliness and tardiness penalties and a common due date, Naval Research Logistics Quarterly, 34, pp. 739-751, (1987)

[2]

Baker K.R., Scudder G.D., Sequencing with earliness and tardiness penalties: A review, Operations Research, 38, 1, pp. 22-36, (1990)

[3]

Baker K.R., Chadowitz A.J., Heuristic Procedures for Minimizing Earliness and Tardiness Penalty with a Common Due Date, (1990)

[4]

Bozer A.Y., White J.A., Travel-time models for automated storage/retrieval systems, IIE Transactions, 16, 4, pp. 329-338, (1984)

[5]

Cheng T., Kahlbacher H.G., A proof for the longest-job-first policy in one-machine scheduling, Naval Research Logistics, 38, pp. 715-720, (1991)

[6]

De P., Ghosh J.B., Wells C.E., Scheduling to minimize weighted earliness and tardiness about a common due-date, Computers and Industrial Engineering, 18, 5, pp. 465-475, (1991)

[7]

Elsayed E.A., Lee M.-K., Kim S., Scherer E., Sequencing and batching procedures for minimizing earliness and tardiness penalties for order retrievals, International Journal of Production Research, 31, 3, pp. 727-738, (1993)

[8]

Goetschalckx M., Storage and Retrieval Policies for Efficient Order Picking Operations, (1983)

[9]

Graves S.C., Hausman W.H., Schwarz L.B., Storage-retrieval interleaving in automatic warehousing systems, Management Science, 23, 9, pp. 935-945, (1977)

[10]

Hall N.G., Kubiak W., Sethi S.P., Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date, Operations Research, 39, 5, pp. 847-856, (1991)

← 1 2 →