Optimization for the cyclic scheduling of polyamide staple fiber plants

Authors:
Hui Jin;Yue-Ling Zhao;Da-Zhi Wang
Affiliations:
Liaoning University of Technology, Jinzhou, China;Liaoning University of Technology, Jinzhou, China;Northeastern University, Shenyang, China
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Year:
2009

Citing 3
Cited 0

The cyclic lot scheduling problem with sequence dependent setups

Operations Research
Variable neighborhood search and local branching

Computers and Operations Research
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of optimizing cyclic schedules in polyamide staple fiber plants. The problem concerns the scheduling of a production consist of two sequence of stages each involving one production line that are interconnected by intermediate warehouse. A mixed-integer programming (MILP) model for cyclic schedules in polyamide staple fiber plants is formulated according to traveling salesman problem (TSP). The objective function of the problem is minimization of sum of costs for changeover and for holding inventory. The MILP formulation was applied to a real-world manufacturing facility and solved by a tabu search (TS) algorithm and improved TS algorithm. The computational results are compared to manual in the plant and verify the effectiveness and applicability of the proposed methods.