Real-Time Scheduling of Jobs with Sequence-Dependent Setups on Unrelated-Parallel Machines

摘要

A methodology for solving a scheduling problem in a sequence-dependent, unrelated-parallel machining environment with dynamic job releases and dynamic machine availability is presented in this paper. The objective function of the model focuses on minimizing the sum of the weighted tardiness of all jobs planned to be released within the planning horizon. A simple dispatching rule based on scheduling a job which contributes to the minimum-weighted tardiness when a machine becomes available is used to identify an initial solution for the problem. Subsequently, a higher-level heuristic algorithm based upon a concept known as 'tabu search' is used to find the best schedule which gives the minimum weighted tardiness. In order to demonstrate the steps associated with the solution algorithm, a simple example problem is solved. This example has all of the necessary characteristics as that in a problem typically found in industry.