Abstract
Assembly job shop scheduling problem (AJSP) is an extension of classical job shop scheduling problem (JSP). AJSP starts with JSP and appends an assembly stage to the completed jobs. Lot streaming (LS) technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. This paper combines, for the first time, LS and AJSP, extending LS applicability to both machining and assembly. To solve this complex problem, an efficient algorithm is proposed using genetic algorithms and simple dispatching rules. Experimental results suggest that equal size LS outperforms varied size LS with respect to the objective function.
| Original language | English |
|---|---|
| Pages (from-to) | 321-331 |
| Number of pages | 11 |
| Journal | Robotics and Computer-Integrated Manufacturing |
| Volume | 24 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jun 2008 |
| Externally published | Yes |
Keywords
- Assembly job shop
- Dispatching rules
- Genetic algorithms
- Lot streaming
ASJC Scopus subject areas
- Control and Systems Engineering
- Software
- General Mathematics
- Computer Science Applications
- Industrial and Manufacturing Engineering
Fingerprint
Dive into the research topics of 'Lot streaming for product assembly in job shop environment'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver