Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates

Muştu, Settar; Eren, Tamer

doi:10.1080/03155986.2021.1904538

Cited by 2 publications

(3 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the due date scheduling problem is proposed, a number of researchers focus on classical shop scheduling problem under JIT environment, e.g., model construction [10][11][12] , solvability and computational time complexity [13][14][15][16][17][18][19] , and designing optimization algorithm 10,12,[20][21][22] . Job is moved from one process to the next process by the robot is not considered in classical shop scheduling problems, that is to say, the robotic moved sequence is not discussed.…”

Section: Reference Reviewmentioning

confidence: 99%

Research on solution property of automatic production system scheduling problem under just-in-time environment

Li,

Zhao,

2023

Fifth International Conference on Artificial Intelligence and Computer Science (AICS 2023)

View full text Add to dashboard Cite

Automatic production system is a kind of artificially intelligent technology. To improve the intelligence of automatic production systems and easily implement simulation experiments, the solution properties of automatic production system scheduling problems under the JIT environment are researched. Firstly, to minimize total earliness/tardiness time, a mixed integer programming of the proposed problem is shown for simultaneously optimizing job scheduling and robotic move sequence. Secondly, to combine job scheduling and robot move sequence, the definition of robotic activity is applied, therefore, two-dimension scheduling problem can be transferred to one dimension scheduling problem. Thirdly, the robotic activity sequence represents the solution to the proposed problem. and solution definition is presented. Finally, the properties of the solution are discussed. The first property means the first two robotic activities and the last two robotic activities of the solution move the first job and the last job of job scheduling, respectively. That is to say, when job scheduling is given, the first two robotic activities and the last two robotic activities of the solution are determined. Thus the number of solutions is reduced from n(m+1)! to [n(m+1)-4]!. Solution space is reduced. The second property means the start moving time of the first robotic activity of each solution is non-negative. The third property and the fourth property show the relation of adjacent tanks. Robotic activity exchanges and job exchanges are discussed in the fifth property and the sixth property, respectively. According to these proposed properties, one solution can turn into another solution, and a theoretical foundation is provided for designing an optimization operator for solving automatic production system scheduling problem under just-in-time environment. The novel mode which optimizes the proposed problem will be developed for constructing simulation experiments.

show abstract

Section: Reference Reviewmentioning

confidence: 99%

Research on solution property of automatic production system scheduling problem under just-in-time environment

Li,

Zhao,

2023

Fifth International Conference on Artificial Intelligence and Computer Science (AICS 2023)

View full text Add to dashboard Cite

show abstract

“…The exact and heuristic methods are proposed [18] and improved the result of literature [17]. According to literature [17], the mathematic programming with considering learning effect and release dates is exhibited [19]. Kayvanfar et al researched the single machine scheduling problem with parallel machine under JIT environment and minimized total earliness/tardiness [11].…”

Section: Literature Reviewmentioning

confidence: 99%

“…In summary, for the flow shop scheduling problem under JIT environment, mathematics model, optimization algorithm, and computational complexity are studied, but the robot moving job between the operations is not considered. Thus, the results of the literatures [14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31][32] cannot be applied to the proposed problem in this paper.…”

Section: Literature Reviewmentioning

confidence: 99%

INEH-VNS Algorithm Solved Automatic Production System Scheduling Problem under Just-in-Time Environment

Qingxiang,

Xiaofei,

Yude

et al. 2023

Journal of Applied Mathematics

View full text Add to dashboard Cite

Automatic production system scheduling problem under a just-in-time environment is researched in this paper. The automatic production system is composed of many tanks and one robotic, the tank of the researched problem is responsible for processing the job, and the robotic moves the job from one tank to the other tank. The difference between the researched problem and the classic shop scheduling problem is that the former must consider job scheduling and the robotic move sequence, but the latter considers only job scheduling. For optimizing simultaneously job scheduling and robotic move sequence in the proposed problem and minimizing total earliness/tardiness, an improved NEH (Nawaz-Enscore-Ham) and variable search (INEH-VNS) algorithm are developed. In the proposed method, firstly, to obtain initial solution, an improved NEH is shown. Secondly, for computing value of the objective function, the double procedure method is constructed. Thirdly, according to the properties of the proposed problem, three neighborhood structures, adjacent exchange, random insertion, and job exchange, are investigated. To test the performance of the INEH-VNS, 100 instances are randomly generated. When the run time is the same, compared with CPLEX 12.5, the INEH-VNS algorithm can find high-quality approximate optimal solution, a special big scale. Compared with the G-VNS algorithm, the average improvement rate of the approximate optimal solution is 45.9%, and the average stability rate of the INEH-VNS algorithm enhances 75.04%. That is to say, the INEH-VNS algorithm is outstanding and more effective.

show abstract

Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates

Cited by 2 publications

References 53 publications

Research on solution property of automatic production system scheduling problem under just-in-time environment

Research on solution property of automatic production system scheduling problem under just-in-time environment

INEH-VNS Algorithm Solved Automatic Production System Scheduling Problem under Just-in-Time Environment

Contact Info

Product

Resources

About