Online Optimal Control Method of Conveyor-serviced Batch Processing System

doi:10.16182/j.issn1004731x.joss.201704005

Abstract

Abstract: In conveyor-serviced batch processing system, jobs arrive dynamically and are stored in a buffer to be further processed by the batch processing machine. Under the cases of non-identical job sizes, online optimal control of the system with a single machine was mainly concerned. Optimization model of the system was built by using look-ahead range as control variable. The objective is to maximize the job processing rate of the system in infinite horizon. Two decision processes are included in the model, which are batching process and action-selection process. For the batching process, the rule of minimizing process-capacity wasting ratio of the machine during production period was proposed. And for the action-selection process, Q-learning algorithm was employed to derive the optimal look-ahead policy. The effectiveness of the proposed algorithms was demonstrated through the simulation experiments. Besides, the influence of some batching rules and physical parameters on system performance was showed.

Key words: batch processing, attribute-different jobs, single machine, online optimization

CLC Number:

TP202

Wu Song, Tang Hao, Tan Qi. Online Optimal Control Method of Conveyor-serviced Batch Processing System[J]. Journal of System Simulation, 2017, 29(4): 730-739.

References

[1] Germs R.Order Acceptance and Scheduling Policies for a Make-to-order Environment with Family-dependent Lead and Batch Setup Times[J]. International Journal of Production Research (S0020-7543), 2013, 51(3): 940-951.
[2] 冯大光, 唐立新. 工件具有不同尺寸单台批处理机的调度问题[J]. 控制工程, 2011, 18(3): 420-423.
(Feng Daguang, Tang Lixin.Research on the Scheduling of Single Batching Machine with Non-identical Job Size[J]. Control Engineering of China, 2011,18(3) : 420-423.)
[3] Uzsoy R.Scheduling a Single Batch Processing Machine with Non-identical Job Sizes[J]. International Journal of Production Research (S0020-7543), 1994, 32(7): 1615-1635.
[4] Dupont L, Dhaenens-Flipo C.Minimizing the Makespan on a Batch Machine with Non-identical Job Sizes: An Exact Procedure[J]. Computers & Operations Research (S0305-0548), 2002, 29(7): 807-819.
[5] Melouk S, Damodaran P, Chang P Y.Minimizing Makespan for Single Machine Batch Processing with Non-identical Job Sizes Using Simulated Annealing[J]. International Journal of Production Economies (S0925-5273), 2004, 87(2): 141-147.
[6] Damodaran P, Manjeshwar P K, Srihari K.Minimizing Makespan on a Batch-processing Machine with Non-identical Job Sizes Using Genetic Algorithms[J]. International Journal of Production Economics (S0925-5273), 2006, 103(2): 882-891.
[7] 谭琦, 陈华平, 杜冰, 等. 面向两客户的差异工件单机批调度问题[J]. 系统仿真学报, 2013, 25(5): 975-982.
(Tan Qi, Chen Huaping, Du Bing, et al.Two-customer Single Batch-processing Machine with Non-identical Job Sizes[J]. Journal of System Simulation (S1004-731X), 2013, 25(5): 975-982.)
[8] Sizes Azimzadeh F, Palizban H A, Romagnoli J A.Online Optimal Control of a Batch Fermentation Process Using Multiple Model Approach[C]// IEEE Conference on Decision & Control, Tampa, Florida. USA: IEEE, 1998: 455-460.
[9] Tajan J B C, Sivakumar A L, Gershwin, et al. Control of a Single Batch Processor with Incompatible Job Families and Future Job Arrivals[J]. Semiconductor Manufacturing (S0894-6507), 2011, 24(2): 208-222.
[10] Fu R Y, Tian J, Yuan J J, et al.Online Scheduling on an Unbounded Parallel-batch Machine and a Standard Machine to Minimize Makespan[J]. Information Processing Letters (S0020-0190), 2014, 114(4): 179-184.
[11] Chen H P, Du B, Huang G Q.Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals[J]. International Journal of Computer Integrated Manufacturing (S0951-192X), 2010, 23(10): 942-956.
[12] 李小林, 杜冰, 谭琦, 等. 分布式环境下批处理机调度启发式算法求解[J]. 系统工程学报, 2012, 27(1): 99-110.
(Li Xiaolin, Du Bing, Tan Qi, et al.Metaheuristics for scheduling batch processing machines in distributed environment[J]. Journal of Systems Engineering, 2012, 27(1): 99-110.)
[13] Zhou S C, Chen H P, Xu R, et al.Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes[J]. International Journal of Production Research (S0020-7543), 2014, 52(8): 2258-2274.
[14] 胡鸿韬, 江志斌, 陈侃. 半导体芯片制造混合调度方法[J]. 上海交通大学学报, 2009, 43(3): 460-464.
(Hu Hongtao, Jiang Zhibin, Chen Kan.Composite scheduling method in semiconductor wafer fabrication[J]. Journal of Shanghai Jiaotong University, 2009, 43(3): 460-464.)
[15] Matsui M.A Generalized Model of Convey-serviced Production Station (CSPS)[J]. Journal of Japan Industrial Management Association (S1342-2618), 1993, 44(1): 25-32.
[16] Matsui M.CSPS Model: Look-ahead Controls and Physics[J]. International Journal of Production Research (S0020-7543), 2005, 43(10): 2001-2025.
[17] Tang H, Arai T.Look-ahead Control of Conveyor- serviced Production Station by Using Potential-based Online Policy Iteration[J]. International Journal of Control (S0020-7179), 2009, 82(10): 1917-1928.
[18] Cao X R.Semi-Markov Decision Problems and Performance Sensitivity Analysis[J]. IEEE Transactions on Automatic Control (S0018-9286), 2003, 48(5): 758-769.