Interactive Job Shop Experiments System on Education

Article Preview

Abstract:

In order to simplify teaching work and improve teaching effect for the education of the job shop problem (JSP), an interactive scheduling experiment system (ISES) is introduced. The system realizes interactive function through 3 modules (move interactive, algorithm interactive, evaluation interactive). Group adjustment and Critical path are built to ensure constraints and search the optimal solution in interactive way, Mathematical model and schedule algorithms are built to help teaching. A teaching example is showed at last.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2938-2941

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Bostjan Murovec, Peter Suhel. A repairing technique for the local search of the job-shop problem[J]. European Journal of Operation Research, 2004, (153): 220-238.

DOI: 10.1016/s0377-2217(02)00733-6

Google Scholar

[2] A.S. Jain,S. Meeran. Deterministic job-shop scheduling: Past, present and future [J]. European Journal of Operational Research, 1999, (113): 390-434.

DOI: 10.1016/s0377-2217(98)00113-1

Google Scholar

[3] Lu HL, George Q. Huang, H.D. Yang Integrating order review/release and dispatching rules for assembly job shop scheduling using a simulation approach[J]. International Journal of Production Research 2011, 49(3): 647-669.

DOI: 10.1080/00207540903524490

Google Scholar

[4] Chao yong Zhang, Peigen Li, yunqing Rao. A very fast TS/SA algorithm for the job shop scheduling problem[J]. computers & operation research 2008. 35: 282-294.

DOI: 10.1016/j.cor.2006.02.024

Google Scholar

[5] Rui Zhang, Cheng Wu. A neighbourhood property for the job shop scheduling problem with application to hybrid particle swarm optimization[J]. IMA Journal management mathematics, 2013, 24(1): 111-134.

DOI: 10.1093/imaman/dps020

Google Scholar

[6] Goncal Ves JF, Demagalhaes mendes JJ, Resende M GC. A hybrid genetic algorithm for the job shop scheduling problems[J]. European Journal of Operation Research, 2005, 167(1): 77-95.

DOI: 10.1016/j.ejor.2004.03.012

Google Scholar

[7] Jose FG, Jorge JMM, Mauricio GC. A hybrid genetic algorithm for the job shop scheduling problems. European Journal of Operation Research, 2005, 167: 77-95.

Google Scholar

[8] L Wang, Bo Liu. Particle swarm optimization and scheduling algorithms [M]. Beijing: Tsinghua University Press, (2008).

Google Scholar