An algorithm for assembly job shop scheduling problem

DOI

10.2991/icence-16.2016.48How to use a DOI?

Keywords

Assembly, job shop, tardiness, earliness.

Abstract

The problem of assembly job shop scheduling (AJSS) is studied with the objective of minimizing the weighted sum of earliness and tardiness penalties. An insertion search algorithm is proposed to solve the problem. The operations of job with tardiness or earliness are shifted left or right to optimize the sequence. Simulation results validate the effectiveness of the proposed model and algorithm.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - XiaoQin Wan
AU  - HongSen Yan
PY  - 2016/09
DA  - 2016/09
TI  - An algorithm for assembly job shop scheduling problem
BT  - Proceedings of the 2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 2016)
PB  - Atlantis Press
SP  - 227
EP  - 231
SN  - 2352-538X
UR  - https://doi.org/10.2991/icence-16.2016.48
DO  - 10.2991/icence-16.2016.48
ID  - Wan2016/09
ER  -