background & aim: nowadays, home health care services play significant roles in modern societies. such services allow the elderly and needy people to pass their treatment process at their own houses in a friendly environment. in this paper, weekly routing and scheduling problem of home health care personnel was investigated. methods & materials: insufficient number of expert personnel or overla...

Permutation Flow Shop Scheduling Problem (PFSP) is a complex combinatorial optimization problem with strong engineering background. To solve the PFSP with makespan criterions, an immune particle swarm optimization (IPSO) algorithm was proposed. The initial solution of the algorithm is generated by the famous heuristic NEH algorithm, it was used to initialize the particle of global extreme value...

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

Task scheduling for the cloud is one of main advances in IoMT stage, which impacts whole execution resource. Cloud a proficient headway computation, and it encompasses data storage, management, manipulation large volumes. Thus, proposition being made better approach to proffer task cloud. In this case, new hybrid genetic algorithm (HGA) proposed. The proposed HGA method will be justified by con...

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

In this paper an ant colony optimization algorithm is developed to solve the permutation flow shop scheduling problem. In the permutation flow shop scheduling problem which has been vastly studied in the literature, there are a set of machines and a set of jobs. All the jobs are processed on all the machines and the sequence of jobs being processed is the same on all the machines. Here this pro...

Permutation flow shop scheduling problem (PFSP) is a well-known NP-hard with extensive engineering relevance. Consequently, various meta-heuristics have been proposed to obtain near optimum solutions. However, most of them involve tuning algorithm-specific parameters, which leads excessive computational complexities. A recently developed meta-heuristic named Jaya algorithm simple yet efficient ...

Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...