A hybrid particle swarm optimisation for scheduling just-in-time single machine with preemption, machine idle time and unequal release times

作者：Seidgar Hany; Abedi Mehdi; Tadayonirad Sahar; Fazlollahtabar Hamed^*

来源：International Journal of Production Research, 2015, 53(6): 1912-1935.

DOI：10.1080/00207543.2014.970705

• single machine
• just-in-time scheduling
• particle swarm optimisation, genetic algorithm, imperialist competitive algorithm
• cloud theory
• release time
• preemption
• machine idle time

This paper addresses preemption in just-in-time (JIT) single-machine-scheduling problem with unequal release times and allowable unforced machine idle time as realistic assumptions occur in the manufacturing environments aiming to minimise the total weighted earliness and tardiness costs. Delay in production systems is a vital item to be focussed to counteract lost sale and back order. Thus, JIT concept is targeted including the elements required such as machine preemption, machine idle time and unequal release times. We proposed a new mathematical model and as the problem is proven to be NP-hard, three meta-heuristic approaches namely hybrid particle swarm optimisation (HPSO), genetic algorithm and imperialist competitive algorithm are employed to solve the problem in larger sizes. In HPSO, cloud theory-based simulated annealing is employed with a certain probability to avoid being trapped in a local optimum. Taguchi method is applied to calibrate the parameters of the proposed algorithms. A number of numerical examples are solved to demonstrate the effectiveness of the proposed approach. The performance of the proposed algorithms is evaluated in terms of relative percent deviation and computational time where the computational results clarify better performance of HPSO than other algorithms in quality of solutions and computational time.

• 出版日期2015-3-19