Studies on optimal scheduling problems for automated manufacturing systems

この論文をさがす

著者

    • 程, 金良 テイ, キンリョウ

書誌事項

タイトル

Studies on optimal scheduling problems for automated manufacturing systems

著者名

程, 金良

著者別名

テイ, キンリョウ

学位授与大学

京都工芸繊維大学

取得学位

博士 (工学)

学位授与番号

甲第151号

学位授与年月日

1997-03-25

注記・抄録

博士論文

目次

  1. Contents / p3 (0005.jp2)
  2. Acknowledgement / p1 (0004.jp2)
  3. 1 Introduction / p1 (0009.jp2)
  4. 1.1 Two-machine flowshop scheduling problems with transportation / p4 (0011.jp2)
  5. 1.2 Three or more machine flowshop scheduling problems with transportation / p7 (0012.jp2)
  6. 1.3 Parallel-machine flowshop scheduling problems / p9 (0013.jp2)
  7. 1.4 AGV or robot scheduling problems / p10 (0014.jp2)
  8. 1.5 Outline of the dissertation / p12 (0015.jp2)
  9. 2 Basic Approaches for Scheduling Problems / p15 (0016.jp2)
  10. 2.1 Definition of scheduling problems / p15 (0016.jp2)
  11. 2.2 Basic approaches for scheduling problems / p17 (0017.jp2)
  12. 2.3 Johnson rule for two-machine flowshop problem / p19 (0018.jp2)
  13. 2.4 Branch and bound algorithm / p21 (0019.jp2)
  14. 3 Automated Two-machine Flowshop Scheduling / p25 (0021.jp2)
  15. 3.1 Introduction / p25 (0021.jp2)
  16. 3.2 Description of the system and the scheduling problem / p26 (0022.jp2)
  17. 3.3 Optimal sequencing / p30 (0024.jp2)
  18. 3.4 Special cases / p34 (0026.jp2)
  19. 3.5 Concluding remarks / p37 (0027.jp2)
  20. 4 Permutation Flowshop Scheduling / p39 (0028.jp2)
  21. 4.1 Introduction / p39 (0028.jp2)
  22. 4.2 Problem formulation / p40 (0029.jp2)
  23. 4.3 BAB algorithm with fuzzy inference / p41 (0029.jp2)
  24. 4.4 Numerical experiments / p47 (0032.jp2)
  25. 4.5 Concluding remarks / p54 (0036.jp2)
  26. 5 Automated m-machine Flowshop Scheduling / p57 (0037.jp2)
  27. 5.1 Introduction / p57 (0037.jp2)
  28. 5.2 Model description / p57 (0037.jp2)
  29. 5.3 Formulation of scheduling problem / p60 (0039.jp2)
  30. 5.4 Fuzzy scheduling / p61 (0039.jp2)
  31. 5.5 BAB algorithm / p64 (0041.jp2)
  32. 5.6 Numerical experiments / p66 (0042.jp2)
  33. 5.7 Concluding remarks / p69 (0043.jp2)
  34. 6 Parallel-machine Flowshop Scheduling / p71 (0044.jp2)
  35. 6.1 Introduction / p71 (0044.jp2)
  36. 6.2 Problem formulation / p72 (0045.jp2)
  37. 6.3 Approximation method / p77 (0047.jp2)
  38. 6.4 Parallel-machine scheduling / p80 (0049.jp2)
  39. 6.5 Timing algorithm / p82 (0050.jp2)
  40. 6.6 Numerical experiments / p84 (0051.jp2)
  41. 6.7 Concluding remarks / p88 (0053.jp2)
  42. 7 Conclusion / p91 (0054.jp2)
  43. 7.1 Summary / p91 (0054.jp2)
  44. 7.2 Future research issues / p92 (0055.jp2)
  45. A Proof of Lemma 5.1 / p95 (0056.jp2)
  46. B Proof of Lemma 5.2 / p97 (0057.jp2)
  47. C Proof of Lemma 5.3 / p99 (0058.jp2)
  48. Bibliography / p105 (0061.jp2)
  49. A List of Author's Work / p113 (0065.jp2)
0アクセス

各種コード

  • NII論文ID(NAID)
    500000151950
  • NII著者ID(NRID)
    • 8000001068877
  • DOI(NDL)
  • NDL書誌ID
    • 000000316264
  • データ提供元
    • NDL-OPAC
    • NDLデジタルコレクション
ページトップへ