In this paper, the unrelated parallel batch processing machine (UPBPM) scheduling problem is addressed to minimize total energy consumption (TEC) and makespan. Firstly, a mixed-integer line programming model (MILP) of UPBPM presented. Secondly, self-adaptive multiobjective differential evolution (AMODE) algorithm put forward. Since parameter value can affect performance greatly, an adaptive con...

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

Two important characteristics encountered in many real-world scheduling problems are heterogeneous processors and a certain degree of uncertainty about the sizes of jobs. In this paper we address both, and study for the first time a scheduling problem that combines the classical unrelated machine scheduling model with stochastic processing times of jobs. By means of a novel time-indexed linear ...

In this paper, we consider scheduling problems with general truncated job-dependent learning effect on unrelated parallel-machine. The objective functions are to minimize total machine load, total completion (waiting) time, total absolute differences in completion (waiting) times respectively. If the number of machines is fixed, these problems can be solved in m O n 2 ( ) + time respectively, w...

A classical scheduling problem is to find schedules that minimize average weighted completion time of jobs with release dates. When multiple machines are available, the machine environments may range from identical machines (the processing time required by a job is invariant across the machines) at one end, to unrelated machines (the processing time required by a job on any machine is an arbitr...

We consider the well known problem of scheduling jobs with release dates to minimize their average weighted completion time. When multiple machines are available, the machine environment may range from identical machines (the processing time required by a job is invariant across the machines) at one end of the spectrum to unrelated machines (the processing time required by a job on each machine...

We consider the well known problem of scheduling jobs with release dates to minimize their average weighted completion time. When multiple machines are available, the machine environment may range from identical machines (the processing time required by a job is invariant across the machines) at one end of the spectrum to unrelated machines (the processing time required by a job on each machine...

We study methods for the exact solution of unrelated parallel machine problem with makespan minimization, generally denoted as R||C max . Our original application arises from automotive assembly process where tasks needs to be distributed among several robots. This involves solutions instances, which proved hard a MILP solver since objective induces weak LP relaxation bounds. To improve these b...

We consider a time-indexed formulation for the unrelated parallel machine scheduling problem. show that all polyhedral knowledge known from single problem (in particular, valid inequalities) is applicable to this formulation. present new facet-inducing inequalities and preprocessing technique involving fixing variables based on reduced costs. combine both techniques in basic cutting-plane algor...