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 条
[1]   SCHEDULING FOR MINIMIZING TOTAL ACTUAL FLOW TIME BY NEURAL NETWORKS [J].
ARIZONO, I ;
YAMAMOTO, A ;
OHTA, H .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1992, 30 (03) :503-511
[2]  
Baker KR., 1974, Introduction to Sequencing and Scheduling
[3]  
DAGLI C, 1991, 1991 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, P2408, DOI 10.1109/ROBOT.1991.131983
[4]   MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].
DU, JZ ;
LEUNG, JYT .
MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (03) :483-495
[5]   ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].
EMMONS, H .
OPERATIONS RESEARCH, 1969, 17 (04) :701-&
[6]  
FOO YPS, P 1998 IEEE INT C NE, P341
[7]   A HEURISTIC SOLUTION PROCEDURE TO MINIMIZE-TBAR ON A SINGLE-MACHINE [J].
FRY, TD ;
VICENS, L ;
MACLEOD, K ;
FERNANDEZ, S .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1989, 40 (03) :293-297
[8]  
GRANINO AK, 1992, NEURAL NETWORK EXPTS
[9]   ADAPTIVE PATTERN-CLASSIFICATION AND UNIVERSAL RECODING .1. PARALLEL DEVELOPMENT AND CODING OF NEURAL FEATURE DETECTORS [J].
GROSSBERG, S .
BIOLOGICAL CYBERNETICS, 1976, 23 (03) :121-134
[10]  
GUPTA JND, P ANN DEC SCI I M SA