Table 4 Dispatching rules.

From: A novel method-based reinforcement learning with deep temporal difference network for flexible double shop scheduling problem

No

SCH

Description

1

First come first served (FIFO)

Processing in sequence according to the arrival order of the job

2

Shortest processing time (SPT)

Sorted by the total processing time of the job on all machines from shortest to longest

3

Shortest remaining processing time (SRPT)

Sorted by the remaining processing time of the job on all machines from shortest to longest

4

Most operations remaining (MOR)

Sorted by the number of the remaining operations on all machines from shortest to longest

5

Earliest due date (EDD)

Sorted by the due date from shortest to longest

6

Apparent tardiness cost (ATC)

Sorted by the tardiness cost from shortest to longest

7

Total least operations remaining (TLOPR)

Sorted by assembly-related constraints of the job from shortest to longest

8

Select no job (SNJ)

Machines don’t select processing each job