نتایج جستجو برای: batch processing machine

تعداد نتایج: 752840  

2006
You In Choung

This paper considers a scheduling problem for a single burn-in oven in the semiconductor manufacturing industry where the oven is a batch processing machine with restricted capacity. The batch processing time is set by the longest processing time among those of all the jobs contained in the batch. All jobs are assumed to have the same due date. The objective is to minimize the sum of the absolu...

2007
James Du Kenneth Salem Miron Livny

The Distributed Batch Controller (DBC) supports scientiic batch data processing. The DBC distributes batch jobs to one or more pools of workstations and monitors and controls their execution. The pools themselves may be geographically distributed, and need not be dedicated to processing batch jobs. We describe the use of the DBC in a large scientiic data processing application, namely the gener...

2013
Conghui Zhu Taro Watanabe Eiichiro Sumita Tiejun Zhao

Typical statistical machine translation systems are batch trained with a given training data and their performances are largely influenced by the amount of data. With the growth of the available data across different domains, it is computationally demanding to perform batch training every time when new data comes. In face of the problem, we propose an efficient phrase table combination method. ...

2015
Qijun Wu Xun Gong

This study established a LabVIEW-based virtual instrument system to measure optical activity through the communication of conventional optical instrument with computer via RS232 port. This system realized the functions for automatic acquisition, real-time display, data processing, results playback, and so forth. Therefore, it improved accuracy of the measurement results by avoiding the artifici...

2007
Chih-Chia YAO Pao-Ta YU

In this paper we propose a modified framework of support vector machines, called Oblique Support Vector Machines(OSVMs), to improve the capability of classification. The principle of OSVMs is joining an orthogonal vector into weight vector in order to rotate the support hyperplanes. By this way, not only the regularized risk function is revised, but the constrained functions are also modified. ...

Journal: :Engineering Optimization 2021

In military manufacturing enterprises, exceptionally high product performance standards are generally met by using heat treatment followed machining. These procedures typically parallel batch-processing (BP) scheduling problems and job-shop problems, respectively. A mixed-integer nonlinear programming model is created to describe the problem with a machine availability constraint, which divided...

2002
James Du Kenneth Salem Miron Livny

The Distributed Batch Controller DBC supports scienti c batch data processing The DBC dis tributes batch jobs to one or more pools of workstations and monitors and controls their execution The pools themselves may be geographically distributed and need not be dedicated to process ing batch jobs We describe the use of the DBC in a large scienti c data processing application namely the generation...

Journal: :Annals OR 2011
John Benedict C. Tajan Appa Iyer Sivakumar Stanley B. Gershwin

front of the batch processor, where they wait to be processed. The batch processor has a finite capacity Q, and the processing time is independent of the number of jobs loaded into the batch processor. In certain manufacturing systems (including semiconductor wafer fabrication), a processing time window exists from the time the job exits the feeder processor till the time it enters the batch pr...

Journal: :Discrete Optimization 2012
Feng-Jang Hwang Mikhail Y. Kovalyov Bertrand M. T. Lin

This paper addresses scheduling n jobs in a two-machine flow shop to minimize the total completion time, subject to the condition that the jobs are processed in the same given sequence on both machines. A new concept of optimal schedule block is introduced, and polynomial time dynamic programming algorithms employing this concept are derived for two specific problems. In the first problem, the ...

Journal: :4OR 2021

We study Pareto-scheduling on an unbounded parallel-batch machine that can process any number of jobs simultaneously in a batch. The processing time batch is equal to the maximum consider two problems. In one problem, are partitioned into families and from different cannot be processed together same assume constant. objective minimize makespan cost. other we have agents A B, where each agent $$...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید