Hello, thank you for your code. I was inspired by it and attempted to use the PPOES algorithm to solve the Flexible Job Shop Scheduling Problem with Transportation (FJSP-T). However, I encountered an issue with defining the boundaries.
In the FJSP-T problem, the schedule sequence is represented by a string like [1, 2, 1, 2], where the numbers 1 and 2 represent job IDs. The first 1 represents the first operation of the first job, and the second 1 represents the second operation of the first job. During the iterations, the number of 1s and 2s in the schedule sequence must remain unchanged.
How can such boundaries be defined in NEORL? Which part of the code should I refer to?🌹
Hello, thank you for your code. I was inspired by it and attempted to use the PPOES algorithm to solve the Flexible Job Shop Scheduling Problem with Transportation (FJSP-T). However, I encountered an issue with defining the boundaries.
In the FJSP-T problem, the schedule sequence is represented by a string like [1, 2, 1, 2], where the numbers 1 and 2 represent job IDs. The first 1 represents the first operation of the first job, and the second 1 represents the second operation of the first job. During the iterations, the number of 1s and 2s in the schedule sequence must remain unchanged.
How can such boundaries be defined in NEORL? Which part of the code should I refer to?🌹