Sensitivity Analysis of Scheduling Solution for Manufacturing System

Article Preview

Abstract:

Data experiments are performed to investigate sensitivity of scheduling solution when disorder occurs due to human participation or other uncertainty in manufacturing system. Benchmark problems are adopted to demonstrate possible variations where entropy approach is introduced to evaluate sensitivity.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

233-236

Citation:

Online since:

November 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Kenneth R. Baker, Dan Trietsch. Principles of sequencing and scheduling, John Wiley & Sons, Inc., Hoboken, New Jersey, 2009.

Google Scholar

[2] Peter Brucker. Scheduling Algorithms. 5th Ed. Springer (2007)

Google Scholar

[3] CN Potts1 and VA Strusevich. Fifty years of scheduling: a survey of milestones. Journal of the Operational Research Society 60, pp.41-68, (2009)

Google Scholar

[4] Jiang Zhenduo, Sun Shijie, Wu Zhigang. Sensitivity analysis for some scheduling problems. Journal of Shanghai University (English Edition),Vol.12, No.1, pp.20-25,(2008)

DOI: 10.1007/s11741-008-0104-3

Google Scholar

[5] S. Lawrence. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), Pittsburgh: Graduate School of Industrial Administration, Carnegie Mellon University, 1982.

Google Scholar

[6] E. Taillard. benchmarks for basic scheduling problem. European Journal of Operational Research 64, pp.278-285, 1993.

DOI: 10.1016/0377-2217(93)90182-m

Google Scholar

[7] E.D. Taillard. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6(2):108-117, 1994.

DOI: 10.1287/ijoc.6.2.108

Google Scholar