In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

Natural disasters, such as earthquakes, tsunamis, and hurricanes cause enormous harm during each year. To reduce casualties and economic losses in the response phase, rescue units must be allocated and scheduled efficiently, such that it is a key issues in emergency response. In this paper, a multi-objective mix integer nonlinear programming model (MOMINLP) is proposed to minimize sum of weight...

<p style='text-indent:20px;'>We consider parallel-machine scheduling in the context of shared manufacturing where each job has a machine set to which it can be assigned for processing. Such is called processing set. In setting, not only certain machines processing, but also processed on remaining at cost. Compared with traditional rejection, model under study embraces notion sustainable m...

<span lang="EN-US">This paper focuses on solving unrelated parallel machine scheduling with resource constraints (UPMR). There are </span><em><span lang="EN-US">j</span></em><span lang="EN-US"> jobs, and each job needs to be processed one of the machines aim at minimizing lang="EN-US">makespan</span></em><span lang="EN-US">. Besides...