A resource-constrained assembly job shop scheduling problem with Lot Streaming technique
Wong, T.C. and Chan, F.T.S. and Chan, L.Y. (2009) A resource-constrained assembly job shop scheduling problem with Lot Streaming technique. Computers and Industrial Engineering, 57 (3). pp. 983-995. ISSN 0360-8352 (https://doi.org/10.1016/j.cie.2009.04.002)
Full text not available in this repository.Request a copyAbstract
To ensure effective shop floor production, it is vital to consider the capital investment. Among most of the operational costs, resource must be one of the critical cost components. Since each operation consumes resources, the determination of resource level is surely a strategic decision. For the first time, the application of Lot Streaming (LS) technique is extended to a Resource-Constrained Assembly Job Shop Scheduling Problem (RC_AJSSP). In general, AJSSP first starts with Job Shop Scheduling Problem (JSSP) and then appends an assembly stage for final product assembly. The primary objective of the model is the minimization of total lateness cost of all final products. To enhance the model usefulness, two more experimental factors are introduced as common part ratio and workload index. Hence, an innovative approach with Genetic Algorithm (GA) is proposed. To examine its goodness, Particle Swarm Optimization (PSO) is the benchmarked method. Computational results suggest that GA can outperform PSO in terms of optimization power and computational effort for all test problems.
ORCID iDs
Wong, T.C. ORCID: https://orcid.org/0000-0001-8942-1984, Chan, F.T.S. and Chan, L.Y.;-
-
Item type: Article ID code: 46819 Dates: DateEvent1 October 2009PublishedSubjects: Technology > Engineering (General). Civil engineering (General) > Engineering design Department: Faculty of Engineering > Design, Manufacture and Engineering Management Depositing user: Pure Administrator Date deposited: 21 Feb 2014 11:43 Last modified: 06 Oct 2024 08:23 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/46819