Each year, disasters (natural or man-made) cause a lot of damage and take many people's lives. In this situation, volunteers come to help. While the proper management is very effective in controlling crisis, lack can create another crisis. Therefore, we introduce model deal with volunteer assignment problem by considering two qualitative objective functions: The first one minimizing mean import...

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

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...

There are many numerous methods for solving large-scale problems in which some of them are very flexible and efficient in both linear and non-linear cases. League championship algorithm is such algorithm which may be used in the mentioned problems. In the current paper, a new play-off approach will be adapted on league championship algorithm for solving large-scale problems. The proposed algori...

In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...