The parallel machine scheduling problem with sequence dependent setup times is among the moststudied and hard combinatorial optimization problems, and has been investigated in depth by numerous researchers of both theoretical and practical interests. An extension of this problem to the case of unrelated parallel machines with multi-objective is evidently more complex, and its application can be...

This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...

mutual information (mi) is a widely used similarity metric for multimodality image registration. however, it involves an extremely high computational time especially when it is applied to volume images. moreover, its robustness is affected by existence of local maxima. the multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...

In this paper, the authors consider a single machine scheduling problem with rejection. In traditional research, it is assumed all jobs must be processed. However, in the real-world situation, certain jobs can be rejected. In this study, the jobs can be either accepted and scheduled or be rejected at the cost of a penalty. Two objective functions are considered simultaneously: (1) minimization ...