Heuristics and exact algorithms for solving the Monden problem

被引：74

作者：

Bautista, J ^{[1
]}

Companys, R ^{[1
]}

Corominas, A ^{[1
]}

机构：

[1] UNIV POLITECN CATALUNA, DEPT MANAGEMENT, E-08028 BARCELONA, SPAIN

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1996年 / 88卷 / 01期

关键词：

sequencing units on assembly lines; JIT; bounded dynamic programming;

D O I：

10.1016/0377-2217(94)00165-0

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Sequencing units on an assembly line in order to obtain a regular requirement of resources is a problem that can be modelled in a variety of ways. One of the most popular is known as the Monden problem, and the heuristic proposed to obtain a 'satisfactory' solution is called 'goal-chasing' method. In the paper the myopic behaviour of this heuristic is shown, and some improvements are proposed. An exact procedure, based on BDP, is also proposed. By relaxing the assumptions, the BDP procedure becomes a new, powerful heuristic. A sample of computational results is included.

引用

页码：101 / 113

页数：13

共 13 条

[1]

[Anonymous], J OPERATIONS MANAGEM

[2]

BAUTISTA J, 1991, INTRO BDP

[3]

BAUTISTA J, 1993, THESIS

[4] AN IMPROVED DISCRETE DYNAMIC-PROGRAMMING ALGORITHM FOR ALLOCATING RESOURCES AMONG INTERDEPENDENT PROJECTS [J].

CARRAWAY, RL ;

SCHMIDT, RL .

MANAGEMENT SCIENCE, 1991, 37 (09) :1195-1200

[5]

COMPANYS R, 1989, CIM, V10, P49

[6] SEQUENCING JIT MIXED-MODEL ASSEMBLY LINES [J].

INMAN, RR ;

BULFIN, RL .

MANAGEMENT SCIENCE, 1991, 37 (07) :901-904

[7] LEVEL SCHEDULES FOR MIXED-MODEL ASSEMBLY LINES IN JUST-IN-TIME PRODUCTION SYSTEMS [J].

KUBIAK, W ;

SETHI, S .

MANAGEMENT SCIENCE, 1991, 37 (01) :121-122

[8]

KUBIAK W, 1993, EUR J OPER RES, V66, P159

[9] HYBRID APPROACH TO DISCRETE MATHEMATICAL-PROGRAMMING [J].

MARSTEN, RE ;

MORIN, TL .

MATHEMATICAL PROGRAMMING, 1978, 14 (01) :21-40

[10] LEVEL SCHEDULES FOR MIXED-MODEL ASSEMBLY LINES IN JUST-IN-TIME PRODUCTION SYSTEMS [J].

MILTENBURG, J .

MANAGEMENT SCIENCE, 1989, 35 (02) :192-207

← 1 2 →