Conceptual framework for lot-sizing and scheduling of flexible flow lines

Quadt, Daniel; Kühn, Heinrich

doi:10.1080/00207540500066762

Cited by 45 publications

(20 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…doi:10. 1016/j.ejor.2006.01.042 wood-processing, textile manufacturing and herbicides production (Riane, 1998), the food and cosmetics (Moursli and Pochet, 2000) as well as the semiconductor industry (Quadt and Kuhn, 2005).…”

Section: Introductionmentioning

confidence: 99%

A taxonomy of flexible flow line scheduling procedures

Quadt

Kühn

2007

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

A taxonomy of flexible flow line scheduling procedures

Quadt

Kühn

2007

European Journal of Operational Research

View full text Add to dashboard Cite

“…According to the literature, this problem models many real case environments such as the chemical industry [43], electronics manufacturing [52], the packaging industry [1], the pharmaceutical sector [17], the automotive industry [3], glass container fabrication [29], wood-processing, textile manufacturing and herbicides production [40], the food and cosmetics [33] as well as the semiconductor industry [41].…”

Section: Literature Reviewmentioning

confidence: 99%

Bi-objective scheduling of flexible flow lines: a gradual transition tabu search approach

Zandieh

Abiri

Rahmati

2016

Prod. Eng. Res. Devel.

View full text Add to dashboard Cite

This paper deals with flexible flow line scheduling problem. Studied researches of the literature assumed that either no setup has to be performed or that setup times are sequence-independent, chiefly. Besides, they are mostly conducted in single objective environment. Therefore, in this study, these two real world concepts are mimicked in the flow line model. The considered objectives of the proposed model are minimizing makespan and total tardiness. Due to the hard solvability of the problem, this research proposes a new multi-objective algorithm based on the single objective tabu search, called gradual transition tabu search (GTTS). GTTS is implemented in two phases and in each phase it tries to gradually modify one objective to the other objective. The neighborhood search efficiency is also improved by defining new candidate list strategies and implementing new dynamic tabu tenure. In addition, the results of the proposed algorithm are compared with two popular existing algorithms, called fast non-dominated sort genetic algorithm (NSGA-II) and multi-objective genetic algorithm, on a number of randomly generated test problems. The suitability of GTTS is demonstrated through different multi-objective evaluation metrics.

show abstract

“…This problem is motivated by a semiconductor assembly facility, which is the third major segment of the semiconductor manufacturing process (the overall process consists of wafer fabrication, wafer probe, assembly, and final test, see [44]). The assembly facility slices the silicon disks ("Wafers"), which are supplied from an intermediate wafer buffer, and packs the individual dies into computer chips.…”

Section: Introductionmentioning

confidence: 99%

Capacitated lot‐sizing and scheduling with parallel machines, back‐orders, and setup carry‐over

Quadt

Kühn

2009

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:We address the capacitated lot-sizing and scheduling problem with setup times, setup carry-over, back-orders, and parallel machines as it appears in a semiconductor assembly facility. The problem can be formulated as an extension of the capacitated lot-sizing problem with linked lot-sizes (CLSPL). We present a mixed integer (MIP) formulation of the problem and a new solution procedure. The solution procedure is based on a novel "aggregate model," which uses integer instead of binary variables. The model is embedded in a period-by-period heuristic and is solved to optimality or near-optimality in each iteration using standard procedures (CPLEX). A subsequent scheduling routine loads and sequences the products on the parallel machines. Six variants of the heuristic are presented and tested in an extensive computational study.

show abstract

Conceptual framework for lot-sizing and scheduling of flexible flow lines

Cited by 45 publications

References 28 publications

A taxonomy of flexible flow line scheduling procedures

A taxonomy of flexible flow line scheduling procedures

Bi-objective scheduling of flexible flow lines: a gradual transition tabu search approach

Capacitated lot‐sizing and scheduling with parallel machines, back‐orders, and setup carry‐over

Contact Info

Product

Resources

About