Batching decisions for assembly production systems
Kovalyov, M.Y., Potts, C.N. and Strusevich, V.A. (2003) Batching decisions for assembly production systems. European Journal of Operational Research, 157, (3), 620-642. (doi:10.1016/S0377-2217(03)00250-9).
Full text not available from this repository.
The two-stage assembly scheduling problem is a model for production processes that involve the assembly of final or intermediate products from basic components. In our model, there are m machines at the first stage that work in parallel, and each produces a component of a job. When all components of a job are ready, an assembly machine at the second stage completes the job by assembling the components. We study problems with the objective of minimizing the makespan, under two different types of batching that occur in some manufacturing environments. For one type, the time to process a batch on a machine is equal to the maximum of the processing times of its operations. For the other type, the batch processing time is defined as the sum of the processing times of its operations, and a setup time is required on a machine before each batch. For both models, we assume a batch availability policy, i.e., the completion times of the operations in a batch are defined to be equal to the batch completion time. We provide a fairly comprehensive complexity classification of the problems under the first type of batching, and we present a heuristic and its worst-case analysis under the second type of batching.
|Keywords:||assembly scheduling problem, flow shop, batching, batch availability, complexity, approximation|
|Subjects:||T Technology > TJ Mechanical engineering and machinery
Q Science > QA Mathematics
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Operational Research
|Date Deposited:||12 May 2006|
|Last Modified:||01 Jun 2011 02:08|
|Contact Email Address:||C.N.Potts@maths.soton.ac.uk|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)