Job shop scheduling with a combination of four buffering constraints
研究了一种结合无等待、无缓冲、有限缓冲和无限缓冲四种约束的通用作业车间调度问题，建立了混合整数规划模型并开发了高效启发式算法，适用于化工、食品、制造、铁路、医疗和航空等行业的实时调度。
In this paper, a new scheduling problem is investigated in order to optimise a more generalised Job Shop Scheduling system with a Combination of four Buffering constraints (i.e. no-wait, no-buffer, limited-buffer and infinite-buffer) called CBJSS. In practice, the CBJSS is significant in modelling and analysing many real-world scheduling systems in chemical, food, manufacturing, railway, health care and aviation industries. Critical problem properties are thoroughly analysed in terms of the Gantt charts. Based on these properties, an applicable mixed integer programming model is formulated and an efficient heuristic algorithm is developed. Computational experiments show that the proposed heuristic algorithm is satisfactory for solving the CBJSS in real time.