Matching heuristic scheduling rules for job shops to the business sales level

被引:0
|
作者
Gray, Clifford [1 ]
Hoesada, Melani [1 ]
机构
[1] Oregon State Univ, Corvallis, United States
来源
关键词
Mathematical Techniques--Heuristic - Production Control--Management;
D O I
暂无
中图分类号
学科分类号
摘要
A job-shop simulation experiment is used to demonstrate the need to switch scheduling dispatch rules as business sales levels change. Given the objective of minimizing average lateness of customer orders, the simulations demonstrate the superiority of different rules as the shop load moves toward or away from shop capacity, which is assumed fixed in the short run. The study uses an 'exchange ratio' of the SPT (shortest processing time) and MS (minimum slack) rules for different levels of sales to gain the advantages of these simple, effective rules. Implementation of the suggested approach would be relatively simple.
引用
收藏
页码:12 / 17
相关论文
共 50 条
  • [31] Scheduling larger job shops: A decomposition approach
    Sun, D
    Batta, R
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (07) : 2019 - 2033
  • [32] Lot-splitting and scheduling algorithm of multi-level assembly job shops
    Li Y.
    Liu J.
    Chen Q.
    Mao N.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (08): : 2307 - 2320
  • [33] Evolving Dispatching Rules in Improved BWO Heuristic Algorithm for Job-Shop Scheduling
    Zhang, Zhen
    Jin, Xin
    Wang, Yue
    ELECTRONICS, 2024, 13 (13)
  • [34] SIMULATION STUDIES OF MULTILEVEL DYNAMIC JOB SHOP SCHEDULING USING HEURISTIC DISPATCHING RULES
    KARSITI, MN
    CRUZ, JB
    MULLIGAN, JH
    JOURNAL OF MANUFACTURING SYSTEMS, 1992, 11 (05) : 346 - 358
  • [35] JOB MATCHING FOR BETTER SALES PERFORMANCE
    GREENBERG, HM
    GREENBERG, J
    HARVARD BUSINESS REVIEW, 1980, 58 (05) : 128 - 133
  • [36] TIME COMPLETION FOR VARIOUS DISPATCHING RULES IN JOB SHOPS
    ELVERS, DA
    TAUBE, LR
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1983, 11 (01): : 81 - 89
  • [37] PRIORITY RULES FOR JOB SHOPS WITH WEIGHTED TARDINESS COSTS
    VEPSALAINEN, APJ
    MORTON, TE
    MANAGEMENT SCIENCE, 1987, 33 (08) : 1035 - 1047
  • [38] Decomposition procedures for global scheduling of complex job shops
    Uzsoy, R
    Wang, CS
    TWENTY FIRST IEEE/CPMT INTERNATIONAL ELECTRONICS MANUFACTURING TECHNOLOGY SYMPOSIUM, 1997, : 425 - 429
  • [39] Scheduling in job shops with machine breakdowns: An experimental study
    University of Passau, Fac. Bus. Admin. Econ., Dept. P., Passau, Germany
    Comput Ind Eng, 1 (137-162):
  • [40] A bi-directional scheduling approach for job shops
    Bushée, DC
    Svestka, JA
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1999, 37 (16) : 3823 - 3837