Scheduling tasks with due dates in a fabrication/assembly process
Operations Research
The shifting bottleneck procedure for job shop scheduling
Management Science
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A fast taboo search algorithm for the job shop problem
Management Science
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Computers and Operations Research
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
Computers and Operations Research
Journal of Intelligent Manufacturing
| Hi-index | 0.00 |
We consider a generalization of the classical job shop scheduling problem with release times, positive end---start time lags, and a general precedence graph. As objective we consider the total weighted tardiness. We use a tabu search algorithm to search for the order in which the operations are processed on each machine. Given a sequence of operations on each machine, we determine optimal starting times by solving a maximum cost flow problem. This solution is used to determine the neighborhood for our tabu search algorithm. All sequences in our neighborhood are obtained by swapping certain pairs of adjacent operations. We show that only swaps that possess a certain property can improve the current solution; if no such swap is available in the neighborhood, then the current solution is globally optimal. In the computational results we compare our method with other procedures proposed in literature. Our tabu search algorithm seems to be effective both with respect to time and solution quality.