A scheduling method in multi-item production adjusting to urgent orders based on job modifiability

被引:0
|
作者
Samejima, Masaki [1 ]
Tamura, Shingo [1 ]
Ikkai, Yoshitomo [1 ]
Komoda, Norihisa [1 ]
Goshima, Hitoshi [1 ]
Mori, Teruyuki [1 ]
机构
[1] Osaka Univ, Grad Sch Informat Sci & Technol, Suita, Osaka, Japan
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The target of this research is to adress scheduling problems in order to ship multi-item orders in a rice milling process on the same day the order is placed. Milled rice can be stored as stock for some days and can be shipped from stock to satisfy, orders. The setup time for,:witching milled items are needed and work hours in a day are given in the process. Scheduling is generated from the producers' order forecast, orders and stock before milling. When new orders during milling(urgent orders) come and exceed the work-in-process stock, the schedule must be modified in order to satisfy the orders. The purpose of this problem is to minimize the number if over time hours worked, to reduce switching time and to maximize throughput. In this problem, because urgent orders account for 90% of the whole, stocks often run out and the need to mill new items often occurs in multi-items. Therefore, this research proposes a modifiable scheduling method to minimize the number of switches and over time hours worked when milling starts in a day and when urgent orders are received. In scheduling, item's to be milled and the amount to mill are first decided using an inventory control theory. The milling sequence is decided using "modifiability", which is defined by the reductibility of milling time and the necessity of modification of items to be milled for modifiable scheduling against urgent orders. In a case where the estimated end time runs over work hours, milling amounts which has smaller stock-out probability are reduced in order of increasing. The proposed method has been applied to a real problem. It has been confirmed that this method can generate the solutions 37% better than producer's solutions.
引用
收藏
页码:1107 / 1112
页数:6
相关论文
共 50 条
  • [1] A Multi-Item Broadcast Scheduling Based on A* Algorithm
    Ma, Xiaoqin
    Yu, Jianqiao
    2009 SECOND INTERNATIONAL CONFERENCE ON FUTURE INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING, FITME 2009, 2009, : 345 - 348
  • [2] FORMALIZED METHOD FOR INTRA-FACTORY ONLINE SCHEDULING OF MULTI-ITEM PRODUCTION
    LEZIN, VI
    NOVIKOV, SG
    TAL, AA
    TVILNEVA, GK
    AUTOMATION AND REMOTE CONTROL, 1980, 41 (12) : 1701 - 1709
  • [3] MINIMISING BACK ORDERS IN A MULTI-ITEM PRODUCTION-INVENTORY SYSTEM
    Tokola, H.
    Ahlroth, L.
    Niemi, E.
    PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE OF DAAAM BALTIC INDUSTRIAL ENGINEERING, VOLS 1 AND 2, 2010, : 392 - 397
  • [4] A heuristic scheduling procedure for multi-item hoist production lines
    Paul, Henrik J.
    Bierwirth, Christian
    Kopfer, Herbert
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2007, 105 (01) : 54 - 69
  • [5] EFFICIENT ALGORITHM FOR MULTI-ITEM SCHEDULING
    LASDON, LS
    TERJUNG, RC
    OPERATIONS RESEARCH, 1971, 19 (04) : 946 - &
  • [6] THE BATCH SCHEDULING MODEL FOR DYNAMIC MULTI-ITEM, MULTI-LEVEL PRODUCTION IN AN ASSEMBLY JOB SHOP WITH PARALLEL MACHINES
    Surjandari, Isti
    Rachman, Amar
    Purdianta
    Dhini, Arian
    INTERNATIONAL JOURNAL OF TECHNOLOGY, 2015, 6 (01) : 84 - 96
  • [7] A SIMPLE METHOD OF PRODUCTION PLANNING IN MULTI-ITEM SITUATIONS
    SPURRELL, DJ
    OPERATIONAL RESEARCH QUARTERLY, 1967, 18 (02) : 149 - &
  • [8] Multi-item order scheduling method based on rule and polychromatic-sets theory
    Gao, Li
    Xu, Kelin
    Mao, Daoxiao
    Li, Yanbing
    Tongji Daxue Xuebao/Journal of Tongji University, 2013, 41 (02): : 258 - 263
  • [9] COLUMN GENERATION BASED HEURISTIC ALGORITHM FOR MULTI-ITEM SCHEDULING
    BAHL, HC
    IIE TRANSACTIONS, 1983, 15 (02) : 136 - 141
  • [10] THE GENERALIZED MULTI-ITEM LOT SIZE SCHEDULING
    PANAYIOTOPOULOS, JC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1983, 14 (01) : 59 - 65