The permutation flow shop with buffers: A tabu search approach

Nowicki, Eugeniusz

doi:10.1016/s0377-2217(98)00017-4

Cited by 97 publications

(25 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each one of the twelve sizes listed in Table 3, ten different matrices were generated with processing times uniformly distributed between 1 and 99. These instances were also used in other works that deal with the flowshop environment with limited buffer; see for example Nowicki (1999), Norman (1999 and Ronconi (2004). Table 3 Table 3 shows the upper and the lower bound obtained by the algorithm b&b prop for each problem.…”

Section: Computational Resultsmentioning

confidence: 99%

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

Ronconi

2005

Ann Oper Res

View full text Add to dashboard Cite

This work addresses the minimization of the makespan criterion for the flowshop problem with blocking. In this environment there are no buffers between successive machines, and therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. We propose a lower bound which exploits the occurrence of blocking. A branch-and-bound algorithm that uses this lower bound is described and its efficiency is evaluated on several problems. Results of computational experiments are reported.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

Ronconi

2005

Ann Oper Res

View full text Add to dashboard Cite

show abstract

“…[22], since it is the best constructive heuristic to minimize the make span in the flow shop with blocking according to Refs. [7,8,17,23]. Thus, Ronconi [33] substituted the initial solution for the enumeration procedure of the NEH algorithm by a heuristic based on a make span property proven in Ref.…”

Section: Literature Reviewmentioning

confidence: 99%

Scheduling a Flow Shop with Simultaneously Loaded Stations: A Real World Application

Herrmann¹

2015

JCSE

View full text Add to dashboard Cite

Abstract:Companies use special designed flow shops, in order to satisfy specific demands. Products need to be transported (from one station to the next station) by a crane and the way of working of this crane excludes the intermediate storage (of a work piece). In addition, the way of working restricts the set of feasible schedules even more than the no-buffer restriction discussed in the literature in the case of limited storage. Since this scheduling problem is integrated in the usual hierarchical planning, the tardiness is minimised. A linear optimisation model is presented to provide a formal description of this NP-hard problem. It is also used to explain the performance of priority rule based heuristic solutions on small test problems. In detail, priority rules as well as a priority rule based branch and bound procedure are analysed; priority rules are regarded, because a priority rule is still the standard procedure for on-line scheduling in industrial practise. Out of successful priority rules in the literature the best one is identified by an extensive simulative investigation. An improved look-ahead is realised by a restricted search over all possible schedules.Key words: Scheduling, real world flow shop with restrictions, no buffer and no wait, minimising tardiness, optimisation model, priority rules, priority rule based branch and bound procedure.

show abstract

“…Disjunctive arcs correspond to possible constraints among the jobs on the same machine. The general graph model of the flow shop with buffers can be found in the article of Nowicki [11].…”

Section: Figure 1 Flow-shop Architecturementioning

confidence: 99%

Flow Shop Scheduling Problem with Transportation Times, Two-Robots and Inputs/Outputs with Limited Capacity

Lamoudan¹,

Elkhoukhi²,

Boukachour³

et al. 2012

IJICR

View full text Add to dashboard Cite

show abstract

The permutation flow shop with buffers: A tabu search approach

Cited by 97 publications

References 9 publications

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

Scheduling a Flow Shop with Simultaneously Loaded Stations: A Real World Application

Flow Shop Scheduling Problem with Transportation Times, Two-Robots and Inputs/Outputs with Limited Capacity

Contact Info

Product

Resources

About