An efficient combination of dispatch rules for job-shop scheduling problem

Abstract

This paper present new combinations of dispatch scheduling for Job Shop Scheduling Problem. The Job Shop Scheduling Problem is one of the NP hard optimization problems, and it is difficult to obtain the exact optimal solution. Scheduling methods based on the dispatch rule are a set of efficient approximate methods. In this paper, by combining several dispatch rules, we have proposed three new rules. The first rule is the rule that combines two simple dispatch rules which are often adopted in actual production systems. The proposed rule gives better result than that of any single dispatch rule. The second rule is the rule that keeps balance of remaining load of all machines. In this rule, the weight is decided in early stage of the schedule. It gives good solutions with high probability. The third rule is the rule that predetermines the mixing ratio, which accompanies a sequence of operations. This rule often gives better results than any other dispatch rules.

Dispatching rule composition method for single machine multi objective dynamic scheduling

“…They are considered to be effective on mean_T. LCDR1 and LCDR2 were proposed for minimizing mean_F and mean_T by [7] [8]. They both combined two elementary dispatching rules in a linear manner.…”

“…Surveys of priority based dispatching rule on dynamic scheduling were reported in [5] and [6]. Some composite dispatching rules were proposed for multi objective scheduling problems in [7] and [8]. However, most of the dispatching rules developed for this type of scheduling problems only concentrate on achieving multi objective satisfaction under a single dimension.…”

“…[8], the weights γ i of each dispatching rule are set as (0.8,0.2) in LCDR1 and (0.6,0.4) in LCDR2. Based on our experiment, LCDR2 can provide best result on mean_T.…”

Refining scheduling policies with genetic algorithms

“…More recently [23] have used dispatching rules with Genetic Programming (GP) for designing effective rules and Kawai and Fujimoto [12] have combined dispatching rules for generating a more effective approach.…”

Multiple Objective Scheduling for Discrete Production System based on Compositional Dispatching Rules

“…[2][3] [4]. Some heuristic method which adopts several dispatching rules in linear combination are proposed to solve MOSP effectively and simply in [5][6] [7]. The dispatching rules to be combined need to be decided corresponding to the nature of the scheduling problem and the performance measure of production.…”