The flow shop with parallel machines: A tabu search approach

Nowicki, Eugeniusz; Smutnicki, Czesław

doi:10.1016/s0377-2217(97)00260-9

Cited by 131 publications

(42 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The space explored can be further pruned by taking into account many other properties of the graphical representation of the problem. These are thor-oughly discussed in [136] and later in [135]. In [136], these properties were used in a TS approach which showed very good results for the makespan objective.…”

Section: Metaheuristicsmentioning

confidence: 99%

“…These are thor-oughly discussed in [136] and later in [135]. In [136], these properties were used in a TS approach which showed very good results for the makespan objective. In [226] an intricate metaheuristic involving the Shifting Bottleneck Procedure (SBP) and a randomized local search procedure were used to minimize the weighted tardiness objective.…”

Section: Metaheuristicsmentioning

confidence: 99%

See 1 more Smart Citation

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

646

236

View full text Add to dashboard Cite

The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed for its solution.The paper discusses several variants of the HFS problem, each in turn considering different assumptions, constraints and objective functions. Research opportunities in HFS are also discussed.

show abstract

Section: Metaheuristicsmentioning

confidence: 99%

Section: Metaheuristicsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

646

236

View full text Add to dashboard Cite

show abstract

“…Smutnicki [12], Barbarosoglu and Ozgur [4], Watsona et al [20], Norman [11], and Grabowski and Wodecki [6]. The SSPP is to determine the arrangement of coils on the ship and the problem shares some features with scheduling problems, which motivates us to adopt TS to solve our problems.…”

Section: The Tabu Search Algorithmmentioning

confidence: 99%

Modeling and solution for the ship stowage planning problem of coils in the steel industry

Tang

Liu

Yang

et al. 2015

Naval Research Logistics

View full text Add to dashboard Cite

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015

show abstract

“…To obtain a near optimal solution, meta-heuristic algorithms have also been proposed. Nowicki and Smutnicki [12] proposed a tabu search (TS) algorithm for the FS makespan problem. Gourgand et al [13] and Zhang and Wu [14] presented several simulated annealing (SA)-based algorithms for the FS problem.…”

Section: Literature Reviewmentioning

confidence: 99%

An electromagnetism-inspired method for a generalized flowshop problem

Khalili

2014

Manufacturing Rev.

View full text Add to dashboard Cite

-There are two common simplifying assumptions made in the scheduling of operations. One is that machines are available continuously, and the other is that once a job completes one process it is immediately available for its next. Moreover, in flowshops, it is commonly assumed that jobs must visit all machines. In practice, however, these assumptions may not be justifiable in some applications. This paper deals with a generalized flow shop (GFS) problem with machine availability constraints, transportation times between stages, and machine skipping. The electromagnetism-like method (EM) has been successfully applied to some NP-hard problems and this has motivated us to apply and assess the effectiveness of an EM algorithm in the GFS scenarios. Simulated annealing (SA) and a number of other well-recognized heuristics to the given GFS scheduling problem that minimizes two independent objective functions, namely the total tardiness and the total completion time also has been applied. In order to evaluate the performance of the proposed EM and SA, a set of practical instances has been considered. The related results are analyzed in two parts; in term of the objective functions, and the observed effects on variables in our instances. Extensive experiments and statistical analyses demonstrate that our proposed EM is more efficient than SA and other heuristics with regards to the objective functions considered in this paper.

show abstract

The flow shop with parallel machines: A tabu search approach

Cited by 131 publications

References 15 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Modeling and solution for the ship stowage planning problem of coils in the steel industry

An electromagnetism-inspired method for a generalized flowshop problem

Contact Info

Product

Resources

About