Abstract: In this paper, we propose two algorithms to optimally
solve makespan and total completion time scheduling problems with
learning effect and job dependent delivery times in a single machine
environment. The delivery time is the extra time to eliminate adverse
effect between the main processing and delivery to the customer. In
this paper, we introduce the job dependent delivery times for some
single machine scheduling problems with position dependent learning
effect, which are makespan are total completion. The results with
respect to two algorithms proposed for solving of the each problem
are compared with LINGO solutions for 50-jobs, 100-jobs and 150-
jobs problems. The proposed algorithms can find the same results in
shorter time.
Abstract: Multiprocessor task scheduling is a NP-hard problem and Genetic Algorithm (GA) has been revealed as an excellent technique for finding an optimal solution. In the past, several methods have been considered for the solution of this problem based on GAs. But, all these methods consider single criteria and in the present work, minimization of the bi-criteria multiprocessor task scheduling problem has been considered which includes weighted sum of makespan & total completion time. Efficiency and effectiveness of genetic algorithm can be achieved by optimization of its different parameters such as crossover, mutation, crossover probability, selection function etc. The effects of GA parameters on minimization of bi-criteria fitness function and subsequent setting of parameters have been accomplished by central composite design (CCD) approach of response surface methodology (RSM) of Design of Experiments. The experiments have been performed with different levels of GA parameters and analysis of variance has been performed for significant parameters for minimisation of makespan and total completion time simultaneously.