科研之友
微信
新浪微博
Facebook
分享链接
摘要
Outsourcing and scheduling in job shop are not considered fully. This paper deals with bi-objective job shop scheduling problem with outsourcing allowed, in which the total tardiness and the outsourcing cost are considered. The lexicographic approach is used to handle these objectives simultaneously. An effective two-phase neighbourhood search (TPNS) is presented, in which an ordered operation list and a binary string are applied to indicate the solution of the problem. In the first phase, several initial solutions are randomly produced and improved independently by using four neighbourhood structures. In the second phase, the best solution of the first phase is optimised by adjusting the number of the outsourced jobs and the schedules of two sets of jobs. TPNS is tested on a number of instances and compared with multi-start algorithm. Computational results show that the proposed algorithm can provide the promising results on the considered problem.
