Akademik Veri Yönetim Sistemi
International Conference on Modelling and Simulation (MS'10), Prague, Çek Cumhuriyeti, 22 - 25 Haziran 2010, ss.341-345
In many real-world production systems, it requires an explicit consideration of sequence-dependent setup times when scheduling jobs. Much of the research on operations scheduling problems has either ignored setup times or assumed that setup times on each machine are independent of the job sequence. This paper considers the problem of scheduling a single machine in a sequence dependent setup environment. The bicriteria objective is a linear combination or weighted sum of nnakespan and total tardiness. This problem is computationally hard because simpler case of the single criterion problem n/1, s(ij)/C-max and n/1, s(ij)/ Sigma T are already known to be NP-hard problems. Motivated by the computational complexity of this problem, a genetic algorithm (GA) is proposed to solve it. The performance of the proposed algorithm is checked by using randomly generated test problems.