Song, D.P.; Earl, C.F. and Hicks, C.
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1080/00207540110035543|
|Google Scholar:||Look up in Google Scholar|
Coordinating due dates of operations throughout all stages of manufacturing and assembly is a problem especially for complex product structures with uncertainties in process times. A recursive procedure is described to estimate distributions of completion times for each operation. Stage due dates are then calculated to meet specified service targets. Compared with plans from existing heuristic methods, there are considerable improvements in meeting service targets and reducing costs. Simulations demonstrate that the method is effective for complex assemblies produced in low volumes by capital goods companies.
|Item Type:||Journal Article|
|Keywords:||dynamic scheduling; engineer to order; rescheduling; optimization; evolution strategy|
|Academic Unit/Department:||Mathematics, Computing and Technology > Engineering & Innovation
Mathematics, Computing and Technology
|Interdisciplinary Research Centre:||Innovation, Knowledge & Development research centre (IKD)|
|Depositing User:||Christopher Earl|
|Date Deposited:||10 Apr 2007|
|Last Modified:||14 Jan 2016 16:31|
|Share this page:|