2008
DOI: 10.1504/ijmtm.2008.017727
|View full text |Cite
|
Sign up to set email alerts
|

A robust scheduling rule using a Neural Network in dynamically changing job-shop environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(24 citation statements)
references
References 13 publications
0
24
0
Order By: Relevance
“…Supervised learning techniques such as decision tree [107,127], logistic regression [57], support vector machines [129], and artificial neural networks [32,138] have also been investigated in the literature for automated design of production scheduling heuristics. For supervised learning, optimal decisions from solving small instances with exact optimisation methods or from the historical data are needed to build the training set.…”
Section: Machine Learningmentioning
confidence: 99%
See 1 more Smart Citation
“…Supervised learning techniques such as decision tree [107,127], logistic regression [57], support vector machines [129], and artificial neural networks [32,138] have also been investigated in the literature for automated design of production scheduling heuristics. For supervised learning, optimal decisions from solving small instances with exact optimisation methods or from the historical data are needed to build the training set.…”
Section: Machine Learningmentioning
confidence: 99%
“…As compared to other hyper-heuristics based on supervised learning such as decision tree [107,127], logistic regression [57], support vector machine [129], and artificial neural networks [32,138], genetic programming (GP) has shown a number of key advantages. First, GP has flexible representations which allow various heuristics to be represented as different computer programs.…”
Section: Introductionmentioning
confidence: 99%
“…Shop configuration Single machine [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33] Parallel machines [34] Job shop [26], [31], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56] Flexible job shop [57], [58], [59], [60], [61], [62], [63], [64], [65] Flow shop [25], [66], [67] Special processing Sequence-dependent setups …”
Section: Problem Class Referencesmentioning
confidence: 99%
“…Parametric representation [21], [38], [42], [46] [35], [36], [41], [45], [47], [52], [57], [58], [59], [67] Grammar-based representation [24], [30], [39] [22], [23], [25], [26], [27], [28], [29], [31], [32], [33], [34], [37], [40], [43], [44], [48], [49], [50], [51], [52], [53], [54], [55], [56], [60], [61], [62], [63], [64], [65], [66] The next section (III-A) discusses the two types of learning methods used within hyper-heuristics, followed by a discussion of the selection of attributes to be provided to the hyperheuristic in Section III-B. The different representations of priority functions are presented in Section III-C together with suitable optimisation algorithms as they are closely tied to the chosen representation.…”
Section: Supervised Learningmentioning
confidence: 99%
“…This cost is a function of critical ratio defined as ratio of due date and total processing time. Eguchi et al (2008) developed a robust and effective scheduling rule using a neural network (NN) which is considered as a priority rule for the complex and dynamic job-shops. Papakostas and Chryssolouris (2009) adopted a new scheduling policy called RTSLACK for improving tardiness and found to be superior as compared to EDD, SPT and SLACK.…”
Section: Priority Rule For Schedulingmentioning
confidence: 99%