In traditional scheduling, job processing times are assumed to be fixed. However, this assumption may not applicable in many realistic industrial processes. Using the time of real processes instead a fixed value converts deterministic model stochastic one. This study provides three approaches solving problem scheduling: linguistic, scenarios, and probabilistic. A combinatorial algorithm, dispat...

We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is an earliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm. KeywordsEarliness-tardiness scheduling, Polyn...

This paper proposes a new real time task scheduling algorithm with GA. The proposed algorithm has multiobjective to minimize the total tardiness and total number of processors used simultaneously. For these conflicting objectives, this paper combines Adaptive Weight Approach (AWA) that utilizes some useful information from the current population to readjust weights for obtaining a search pressu...