Now showing items 1-2 of 2
Satisfying due-dates in a job shop with sequence-dependent family set-ups
(Taylor & Francis, 2003)
This paper addresses job shop scheduling with sequence dependent family set-ups. Based on a simple, single-machine dynamic scheduling problem, state dependent scheduling rules for the single machine problem are developed ...
A problem space algorithm for single machine weighted tardiness problems
(Taylor & Francis Inc., 2003)
We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood ...