Batching plays an important role in performance evaluation of manufacturing systems. Three types of batching are commonly seen: transfer batches, parallel batches and serial batches. To model the batching behavior correctly, a comprehensive classification of batching is proposed. Eight types of batching behavior are classified and corresponding queueing models are given. The newly proposed mode...

We consider a single-item, periodic-review, serial, multi-echelon inventory system, with linear inventory holding and penalty costs. In order to facilitate shipment consolidation and capacity planning, we assume the system has implemented periodic batching: each stage is allowed to order at given equidistant times. Further, for each stage except the most downstream one, the reorder interval is ...

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...

This paper considers a class of simultaneous optimization scheduling with two competitive agents on an unbounded serial-batching machine. The cost function each agent depends the completion times its jobs only. According to whether from different can be processed in common batch, compatible model and incompatible are investigated. For model, we consider batch availability item availability. pro...

This paper studies a hierarchical optimization problem of scheduling n jobs on serial-batching machine, in which two objective functions are maximum costs. By problem, we mean the optimizing secondary criterion under constraint that primary is optimized. A machine can handle up to b batch and start complete respectively at same time processing equal sum times batch. When new starts, constant se...

We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1|s-batch| P Ti is known to be NP-Hard in the ordinary sense. In this paper we show that ...

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...

The coordination of production scheduling and transportation has recently received a lot of attention in logistics and supply chain management. We study a coordinated scheduling problem, in which each job is transported to a single serial batching machine for further processing, each batch to be processed occurs a processing cost, and the objective is minimizing the sum of the makespan and the ...