Sequencing jobs on a single machine: A neural network approach

被引:28
作者
El-Bouri, A [1 ]
Balakrisknan, S [1 ]
Popplewell, N [1 ]
机构
[1] Univ Manitoba, Fac Engn, Dept Mech Engn, Winnipeg, MB R3T 2N2, Canada
关键词
neural networks; job sequencing; heuristics; supervised learning;
D O I
10.1016/S0377-2217(99)00302-1
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents an approach for single machine job sequencing problems that is based on artificial neural networks. Pt problem is classified first by one type of neural network into one of a number of categories. The categorization is based on the problem's characteristics. Then another neural network, which is specialized for a particular category, applies a previously 'learnt' relationship to produce a job sequence that aims to better satisfy the given objective. The learning is acquired in these networks after a training process in which the network is exposed repeatedly to a set of example problems and their solutions. The trained network thereby learns predominant relationships between given problems, and the output sequences that optimally meet the desired objective. The advantage of such an approach is that it allows what amounts to a 'customized' heuristic to be established far problem subsets and various objectives without having to deduce an algorithm in advance. The methodology and its implementation is described for several of the more common sequencing objectives, as well as for a hypothetical objective that minimizes a cost function exhibiting a limited exponential behavior. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:474 / 490
页数:17
相关论文
共 25 条
[11]   A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].
HELD, M ;
KARP, RM .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210
[12]  
HOLSENBACK JE, 1992, J OPER RES SOC, V43, P53
[13]  
HOPFIELD JJ, 1985, BIOL CYBERN, V52, P141
[14]   THE TOTAL TARDINESS PROBLEM - REVIEW AND EXTENSIONS [J].
KOULAMAS, C .
OPERATIONS RESEARCH, 1994, 42 (06) :1025-1041
[15]   OPTIMAL SEQUENCING OF A SINGLE MACHINE SUBJECT TO PRECEDENCE CONSTRAINTS [J].
LAWLER, EL .
MANAGEMENT SCIENCE SERIES A-THEORY, 1973, 19 (05) :544-546
[16]   VARIANCE MINIMIZATION IN SINGLE MACHINE SEQUENCING PROBLEMS [J].
MERTEN, AG ;
MULLER, ME .
MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (09) :518-528
[17]   A HEURISTIC FOR THE SINGLE-MACHINE TARDINESS PROBLEM [J].
PANWALKAR, SS ;
SMITH, ML ;
KOULAMAS, CP .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 70 (03) :304-310
[18]   SINGLE-MACHINE TARDINESS SEQUENCING HEURISTICS [J].
POTTS, CN ;
VANWASSENHOVE, LN .
IIE TRANSACTIONS, 1991, 23 (04) :346-354
[19]  
RUMELHART DE, 1986, PDP RES PARALLEL DIS, V1
[20]   Evaluation of leading heuristics for the single machine tardiness problem [J].
Russell, RM ;
Holsenback, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) :538-545