A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines

作者：Bilyk Andrew; Moench Lars

来源：Journal of Intelligent Manufacturing, 2012, 23(5): 1621-1635.

DOI：10.1007/s10845-010-0464-6

• Planning
• Scheduling
• Parallel machines
• Decomposition
• Variable neighborhood search
• Computational experiments

In this paper, we study a planning and scheduling problem for unrelated parallel machines. There are n jobs that have to be assigned and sequenced on m unrelated parallel machines. Each job has a weight that represents the priority of the corresponding customer order, a given due date, and a release date. An Automated Guided Vehicle is used to transport at maximum Load (max) jobs into a storage space in front of the machines in a given period of time. We consider t (max) consecutive periods. We are interested in minimizing the total weighted tardiness of the jobs across the periods. This measure is important when we are interested in a good on-time delivery performance. We present an appropriate mixed integer program. To solve this NP-hard problem, we develop a heuristic methodology based on decomposition and variable neighborhood search (VNS). The proposed approaches are assessed using randomly generated problem instances. We compare them with a simple heuristic based on decomposition and list scheduling using the Apparent Tardiness Cost dispatching rule. The results demonstrate that the heuristic approach based on VNS performs comparably to the mixed integer program while having reasonable solution times and outperforms the simple heuristic and a genetic algorithm (GA) from previous research.

• 出版日期2012-10