Real-Time Near-Optimal Scheduling With Rolling Horizon for Automatic Manufacturing Cell

被引:11
|
作者
Hsu, Chih-Hua [1 ]
Yang, Haw-Ching [2 ]
机构
[1] Chang Jung Christian Univ, Dept Informat Management, Tainan 711, Taiwan
[2] Natl Kaohsiung First Univ Sci & Technol, Grad Inst Elect Engn, Kaohsiung 811, Taiwan
来源
IEEE ACCESS | 2017年 / 5卷
关键词
Earliness and tardiness cost; mixed integer linear programming; real-time scheduling; rolling horizon optimization; setup times; single machine scheduling; DEPENDENT SETUP TIMES; SINGLE-MACHINE; TARDINESS PENALTIES; SEQUENCING PROBLEM; EARLINESS; SEARCH;
D O I
10.1109/ACCESS.2016.2616366
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents position-based optimization methods to schedule the production of automatic cells of a wheel manufacturing factory. Real-time schedule is challenging when a cell is interrupted by various order changes. Given a sequence of orders to be scheduled, it is sorted based on an earliest due day policy, a mixed integer linear programming model is formulated, and then rolling-horizon optimization methods are used to timely find the near-optimal schedule by minimizing earliness and tardiness penalties with setup times of a manufacturing cell. In addition, an original schedule can be partial rescheduled with the preset order sequence by using the linear programming model. Experimental results show that the proposed method enables a wheel manufacturing cell to reschedule its three to five daily orders within the cycle time of a rim when there exist order changes, e.g., rush orders and customized orders. Hence, these proposed methods are promising to promptly derive the near-optimal schedule for satisfying the objective of mass customization for industry 4.0.
引用
收藏
页码:3369 / 3375
页数:7
相关论文
共 50 条
  • [1] Metaheuristics for real-time near-optimal train scheduling and routing
    Sama, M.
    D'Ariano, A.
    Toli, A.
    Pacciarelli, D.
    Corman, F.
    2015 IEEE 18TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, 2015, : 1678 - 1683
  • [2] Global Scheduling Not Required: Simple, Near-Optimal Multiprocessor Real-Time Scheduling with Semi-Partitioned Reservations
    Brandenburg, Bjoern B.
    Guel, Mahircan
    PROCEEDINGS OF 2016 IEEE REAL-TIME SYSTEMS SYMPOSIUM (RTSS), 2016, : 99 - 110
  • [3] Optimal Operation of Smart Houses by a Real-time Rolling Horizon Algorithm
    Paterakis, Nikolaos G.
    Pappi, Iliana N.
    Catalao, Joao P. S.
    Erdinc, Ozan
    2016 IEEE POWER AND ENERGY SOCIETY GENERAL MEETING (PESGM), 2016,
  • [4] A Near-Optimal Bidding Strategy for Real-Time Display Advertising Auctions
    Tunuguntla, Srinivas
    Hoban, Paul R.
    JOURNAL OF MARKETING RESEARCH, 2021, 58 (01) : 1 - 21
  • [5] Real-Time near-optimal Path and Maneuver Planning in Automatic Parking Using a Simultaneous Dynamic Optimization Approach
    Moon, Jaeyoung
    Bae, Il
    Kim, Shiho
    2017 28TH IEEE INTELLIGENT VEHICLES SYMPOSIUM (IV 2017), 2017, : 193 - 196
  • [6] Rolling-horizon scheduling for energy constrained distributed real-time embedded systems
    He, Chuan
    Zhu, Xiaomin
    Guo, Hui
    Qiu, Dishan
    Jiang, Jianqing
    JOURNAL OF SYSTEMS AND SOFTWARE, 2012, 85 (04) : 780 - 794
  • [7] A Real-Time Rolling Horizon Chance Constrained Optimization Model for Energy Hub Scheduling
    Hou, Weilin
    Liu, Zhaoxi
    Ma, Li
    Wang, Lingfeng
    SUSTAINABLE CITIES AND SOCIETY, 2020, 62
  • [8] Dynamic Optimality in Real-Time: A Learning Framework for Near-Optimal Robot Motions
    Weitschat, Roman
    Haddadin, Sami
    Huber, Felix
    Albu-Schaeffer, Alin
    2013 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2013, : 5636 - 5643
  • [9] Optimal and near-optimal algorithms to rolling batch scheduling for seamless steel tube production
    Tang, Lixin
    Huang, Lin
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2007, 105 (02) : 357 - 371
  • [10] Development of a real-time, near-optimal control process for water-distribution networks
    Rao, Zhengfu
    Salomons, Elad
    JOURNAL OF HYDROINFORMATICS, 2007, 9 (01) : 25 - 37