Single Machine JIT Scheduling Problem Considering the Release Time

doi:10.12005/orms.2016.0085

Operations Research and Management Science ›› 2016, Vol. 25 ›› Issue (3): 71-77.DOI: 10.12005/orms.2016.0085

• Theory Analysis and Methodology Study • Previous Articles Next Articles

Single Machine JIT Scheduling Problem Considering the Release Time

LI Kai^1,2, ZHOU Chao¹, MA Ying^1,2

1.School of Management, Hefei University of Technology, Hefei 230009, China;
2.Key Laboratory of Process Optimization and Intelligent Decision-making, Ministry of Education, Hefei 230009, China

Received:2014-05-28 Online:2016-06-25

考虑释放时间的单机JIT调度问题

李凯^1,2,周超¹,马英^1,2

1.合肥工业大学管理学院,安徽合肥 230009;
2.过程优化与智能决策教育部重点实验室,安徽合肥 230009

作者简介:李凯(1977-),男,安徽蒙城人,合肥工业大学副教授,博士。研究方向:生产调度,供应链管理、优化算法。
基金资助:
国家自然科学基金(71101040, 71471052);安徽省自然科学基金(11040606Q27).

Abstract

Abstract: This paper mainly studies the production, inventory and direct distribution coordination optimization scheduling problem in the two-stage supply chain consisting of a manufacturer and multiple retailers. The manufacturer makes the products according to orders and then distribute the products to retailers. This kind of problem can be abstracted as the single machine JIT scheduling problem considering the release time. With the help of Tabu search algorithm, we propose the CTA-TS algorithm for solving the problem and show the effectiveness of our algorithm to the existing algorithm by a lot of experimental data.

Key words: operations research and management science, production-inventory-direct distribution, tabu search algorithm, single machine JIT scheduling

摘要： 本文主要研究二级供应链中的生产-库存-直接配送协同调度问题,其中存在一个制造商和多个零售商, 制造商根据订单进行生产, 然后将产品配送给零售商。该类问题可以抽象为考虑释放时间的单机JIT调度问题。借助于禁忌搜索算法, 本文提出了求解问题的CTA-TS算法, 并通过大量的实验数据与已有算法进行比较,说明了本文提出算法的有效性。

关键词: 运筹与管理, 生产-库存-直接配送, 禁忌搜索算法, 单机JIT调度

CLC Number:

LI Kai, ZHOU Chao, MA Ying. Single Machine JIT Scheduling Problem Considering the Release Time[J]. Operations Research and Management Science, 2016, 25(3): 71-77.

李凯,周超,马英. 考虑释放时间的单机JIT调度问题[J]. 运筹与管理, 2016, 25(3): 71-77.

References

[1] Li C L. Machine scheduling with pickup and delivery[J]. Naval Research Logistics, 2005, 52: 617-630.
[2] Geismar H N, Laporte G, Lei L, Sriskandarajah C. The integrated production and transportation scheduling problem for a product with a short lifespan[J]. INFORMS Journal on Computing, 2008, 20(1): 21-33.
[3] Calvete H I, Galé C, Oliveros M J. Bilevel model for production–distribution planning solved by using ant colony optimization[J]. Computers & Operations Research, 2011, 38(1): 320-327.
[4] Leung J Y T, Chen Z L. Integrated production and distribution with fixed delivery departure dates[J]. Operations Research Letters, 2013, 41(3): 290-293.
[5] Ronconi Kawamura. The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm[J]. Computational &Applied Mathematics, 2010, 29: 107-124.
[6] Safia K S, Francis S. Fast neighborhood search for the single machine earliness-tardiness scheduling problem[J]. Computers & Operations Research, 2010, 37: 1464-1471.
[7] Ma H L, Chan T S, Chung S H. Minimising earliness and tardiness by integrating production scheduling with shipping information[J]. International Journal of Production Research, 2013, 51(8): 2253-2267.
[8] Valente J M, Alves R A. An exact approach to early/tardy scheduling with release dates[J]. Computers & Operations Research, 2005, 32: 2905-2917.
[9] Detienne B, Pinson E, Rivreau D. Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates[J]. European Journal of Operational Research, 2010, 201: 45-54.
[10] Khorshidian H, Javadian N, Zandieh M,et al. A genetic algorithm for JIT single machine scheduling with preemption and machine idle time[J]. Expert Systems with Applications, 2011, 38: 7911-7918.
[11] Szwarc W, Mukhopadhyay S K. Optimal timing schefdules in earliness-tardiness single machine sequencing[J]. Naval Research Logistics Quarterly, 1995, 42:1109-1114.

Single Machine JIT Scheduling Problem Considering the Release Time

考虑释放时间的单机JIT调度问题

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 4

Recommended Articles

Metrics

[1]	CHEN Yu-ting, ZHANG Hui-zhen. Two-level Medical Facility Location Problem and Tabu Search Algorithm [J]. Operations Research and Management Science, 2021, 30(9): 56-63.
[2]	HU Xue-jun, WANG Jian-jiang, TAN Yue-jin, Xu Pei-de, CUI Nan-fang. Resource Flow-based Model and Algorithms for the RCPSP with Resource Transfer Times [J]. Operations Research and Management Science, 2021, 30(12): 42-50.
[3]	WANG Jun. Sustainable Multi-machine Scheduling Problem Considering Carbon Emission [J]. Operations Research and Management Science, 2017, 26(8): 187-192.
[4]	YANG Jun, LU Wei, LIU Shu-ji. Critical Facility Identification Problems Based On Hub-and-Spoke Network [J]. Operations Research and Management Science, 2016, 25(3): 85-93.