Basic techniques for lot streaming
Operations Research
Lot streaming and scheduling heuristics for m-machine no-wait flowshops
Computers and Industrial Engineering
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
Computers and Operations Research
Scheduling rules for dynamic shops that manufacture multi-level jobs
Computers and Industrial Engineering
Evolutionary algorithms for scheduling m-machine flow shop with lot streaming
Robotics and Computer-Integrated Manufacturing
Lot streaming for product assembly in job shop environment
Robotics and Computer-Integrated Manufacturing
A decomposition algorithm for the single machine total tardiness problem
Operations Research Letters
Operations Research Letters
Hi-index | 0.00 |
Assembly job shop problem (AJSP) is an extension of classical job shop problem (JSP). AJSP first starts with a JSP and appends an assembly stage after job completion. Lot Streaming (LS) technique is defined as the process of splitting lots into sub-lots such that successive operation can be overlapped. In this paper, the previous study of LS to AJSP is extended by allowing part sharing among distinct products. In addition to the use of simple dispatching rules (SDRs), an evolutionary approach with genetic algorithm (GA) is proposed to solve the research problem. A number of test problems were conducted to examine the performance of the proposed algorithm. Computational results suggested that the proposed algorithm can outperform the previous one, and can work well with respect to the objective function. Also, the inherent conflicting relationship between the primary objective and the system measurements can be addressed.