This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

this paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. we assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. in this paper, we present an artificial imm...

Motivated by applications in porcelain-making companies, we consider a type of optimization problems for batch-processing operations. In production, single machine with fixed capacity is used to process jobs. Several jobs can be processed together if their total size no more than the capacity. Batch-position-based learning effects are considered because workers become skillful gradually after t...

This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...

We consider the problem of minimizing the makespan(Cmax) on m identical parallel batch processing machines. The batch processing machine can process up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. For a batch of jobs, the processing time of the batch is equal to the largest processing time among the job...

We consider the problem of scheduling n jobs with release dates on m identical parallel batch processing machines so as to minimize the maximum lateness. Each batch processing machine can process up to B (B < n) jobs simultaneously as a batch, and the processing time of a batch is the largest processing time among the jobs in the batch. Jobs processed in the same batch start and complete at the...

Today, online transaction processing applications can downsize from mainframes to microprocessors. Commodity database systems, operating systems, and hardware came of age in 1993., -they surpassed the online transaction processing performance of proprietary solutions. There are lingering doubts about downsizing batch transaction processing applications. The doubts center on the ability of micro...

In a batch processing network, multiple jobs can be formed into a batch to be processed in a single service operation. The network is multiclass in that several job classes may be processed at a server. Jobs in different classes cannot be mixed into a single batch. A batch policy specifies which class of jobs is to be served next. Throughput of a batch processing network depends on the batch po...

‎in this paper, we study a flow shop batch processing machines scheduling problem. the fuzzy due dates are considered to make the problem more close to the reality. the objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. in order to tackle the given problem, we propose a hybrid electromagnetism-like (em) algorithm, in which the em is hybridized with a diversi...