Job shop scheduling problem with a dual-gripper robot
研究了无缓冲作业车间中双夹持器机器人的调度问题，提出混合整数线性规划和改进模拟退火算法，以最小化完工时间和机器人能耗。
Robots are increasingly being deployed as integral material-handling components within automated manufacturing systems. In this paper, we address the scheduling problem in a bufferless job shop environment, in which multiple job types are served by a dual-gripper robot. The dual-gripper robot is capable of holding two jobs simultaneously but can load or unload only one job at a time, while also accounting for the time required for the robot to switch grippers. In this work, we consider the job shop scheduling problem with a dual-gripper robot for two objectives: one is to minimize the makespan (Basic model), the other is to minimize both the makespan and the robot energy consumption (Extended model). For each model, we propose a mixed-integer linear program (MILP). Due to the complexity of these problems, we develop an associated improved simulated annealing (ISA) algorithm for each model. Extensive computational experiments are conducted to evaluate the performance of both the MILP models and ISA algorithms, and the results confirm the superiority of the ISA algorithms compared to the MILP models and several other heuristic algorithms.