Machine Selection Rules in a Dynamic Job Shop

A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions

“…In the integrated approach, the eligible job operations are assigned to the first available machine. Due to the inherent complexity of the problem, most solution procedures put a clear focus on meta-heuristic search optimization, and hence, little or no research is available on the use of (static and/or dynamic) priority rules to solve the flexible job shop problem, mainly done by Kim (1990), Chen and Luh (2003), Subramaniam et al (2000b), Ho and Tay (2005) and Tay and Ho (2008). Table 4 displays comparative results between the hierarchical and integrated approaches tested on the most flexible vdata of Hurink et al (1994) as mentioned in Section 3.1.…”

“…Table 4 displays comparative results between the hierarchical and integrated approaches tested on the most flexible vdata of Hurink et al (1994) as mentioned in Section 3.1. The results obtained by using the hierarchical solution approach use the "Lowest Average Process Time (LAP)" rule of Subramaniam et al (2000b) and the "Shortest Queue (SQ)" and the "Least Work in Queue (LW)" rules of Chen and Luh (2003) …”

Ontology-Based Finding of Feasible Machine Changes

“…Next focus is the integration with the operations scheduling and dispatching module. Experiments of other researchers have already shown that the number of identified suitable resources has a high impact on the efficiency of scheduling and dispatching [19].…”

Development and evaluation of feature-focused dynamic routing policy

“…Routing flexibility in FMS means that alternative machines are available for the same operation in the system. Several researchers investigated the effect of only routing flexibility on the performance of the FMS: the effect of alternative routings and fixed routing of the parts on the performance of the FMS [3], the effect of routing flexibility with alternative machines of identical type [4], consideration of infinite buffer capacity defining a threshold-based decision-making approach to decide when to consider alternative operation [5], basing the machine selection rules on the processing cost, processing time, and combination of the both [6], or experimentation with three control policies (auction bidding, job sequencing, or their combination) [7]. Availability of alternative process plans for each part in advance helps the scheduler in rerouting part in case of events like machine breakdown, long waiting queue for operation, and failure of system objective.…”