Metaheuristic for Solving Multi-Objective Job Shop Scheduling Problem in a Robotic Cell

This paper deals with the multi-objective job shop scheduling problem in a robotic cell (MOJRCSP). All the jobs are processed according to their operations order on workstations. Different from classical job shop scheduling problem, the studied problem considers that jobs' transportation is handled by a robot. Also, the jobs are expected to be finished in a time window, instead of a constant due date. A mixed Integer Programming (MIP) model is proposed to formulate this problem. Due to the special characteristics of the studied problem and its NP-hard computational complexity, a metaheuristic based on Teaching Learning Based Optimization (TLBO) algorithm has been proposed. The proposed algorithm determines simultaneously the operations' assignments on workstations, the robot assignments for transportation operations, and the robot moving sequence. The objective is to minimize the makespan and the total earliness and tardiness. Computational results further validated the effectiveness and robustness of our proposed algorithm.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.