In this paper, a Branch-and-Bound (B&B) algorithm is presented to solve the problem of minimizing the maximum completion time Cmax on unrelated parallel machines with machine eligibility restrictions when job preemption is not allowed. A customized lower bound, a search and a branching strategy are developed for the B&B. A machine eligibility factor is also introduced to represent the percentag...

This paper investigates scheduling problems with simultaneous considerations of deterioration effects and deteriorating multi-maintenance activities on unrelated parallel machines. We examine two models of scheduling with the deterioration effect, namely the job-dependent and position-dependent deterioration model and the time-dependent deterioration model. We assume that each machine may be su...

Abstract This paper addresses the unrelated parallel machine scheduling problem with sequence and dependent setup times eligibility constraints. The objective is to minimize maximum completion time (makespan). Instances of more than 500 jobs 50 machines are not uncommon in industry. Such large instances become increasingly challenging provide high-quality solutions within limited amount computa...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

scheduling has become an attractive area for artificial intelligence researchers. on other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. a maintenance program may be considered as the heath care of manufacturing machines and equip...