Cyclic jobshop hoist scheduling with multi-capacity reentrant tanks and time-window constraints. (June 2018)

• Record Type: Journal Article
• Authors: Feng, Jianguang; Chu, Chengbin; Che, Ada
• Is Part Of: Computers & industrial engineering. Volume 120(2018)
• Page Start: 382
• Page End: 391
• Publication Date: 2018-06
• Subjects: Cyclic jobshop scheduling -- Hoist scheduling -- Multi-capacity reentrant tanks -- Mixed-integer linear programming; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2018.04.046
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: We study a cyclic jobshop hoist scheduling problem with multi-capacity reentrant tanks. Parts are processed in a set of tanks with time-window constraints. The constraints related to tank capacity and time-window are analyzed. A novel mixed-integer programming model is developed. Computational experiments indicate the efficiency of the proposed model. Abstract: This paper studies the cyclic jobshop hoist scheduling with multi-capacity reentrant tanks and time-window constraints. Parts of different types are processed in a series of tanks with bounded processing times. Multi-capacity tanks are used to handle stages with long processing times. Tanks can be reentrant so that a part visits them more than once. A hoist is responsible for the transportation of parts between tanks. We consider the cyclic scheduling where multiple parts enter and leave the production line during a cycle. The difficulty to deal with the problem lies in how to effectively handle the constraints related to multi-capacity reentrant tanks and their relations with time windows. To this end, a mixed-integer linear programming model is developed by addressing the time-window constraints and tank capacity constraints in a novel way. Computational experiments are conducted to demonstrate the effectiveness of the proposed model.