A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots

Kalir, Adar A.; Sarin, Subhash C.

doi:10.1016/s0305-0483(01)00046-9

Cited by 63 publications

(31 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar to [12], the results are categorised into three levels of weak, medium and strong P1 dominance as shown in Table 8 where n equals number of jobs.…”

Section: Bam3 Heuristic Performance Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine

Bareduan

Hasan

2008

2008 IEEE International Conference on Industrial Engineering and Engineering Management

View full text Add to dashboard Cite

-This paper presents a scheduling heuristic to minimize the makespan of a re-entrant flow shop using bottleneck analysis. The heuristic is specifically intended for the cyber manufacturing centre (CMC) which is an Internetbased collaborative design and manufacturing between the Universiti Tun Hussein Onn Malaysia and the small and medium enterprises. The CMC processes scheduling resembles a four machine permutation re-entrant flow shop with the process routing of M1,M2,M3,M4,M3,M4 in which the first process at M1 has high tendency of exhibiting dominant characteristic. It was shown that using bottleneckbased analysis, an effective constructive heuristic can be developed to solve for near-optimal scheduling sequence. At strong machine dominance level and medium to high job numbers, this heuristic shows slightly better makespan performance compared to the NEH. However, for smaller job numbers, NEH is superior.

show abstract

“…Similar to [12], the results are categorised into three levels of weak, medium and strong P1 dominance as shown in Table 8 where n equals number of jobs.…”

Section: Bam3 Heuristic Performance Evaluationmentioning

confidence: 99%

“…This includes shifting bottleneck heuristic [10,11] and bottleneck minimal idleness heuristic [12,13]. However, not much progress is reported on bottleneck approach in solving re-entrant flow shop problem.…”

Section: Introductionmentioning

confidence: 99%

Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine

Bareduan

Hasan

2008

2008 IEEE International Conference on Industrial Engineering and Engineering Management

View full text Add to dashboard Cite

show abstract

“…For the m-machine lot-streaming flow shop problem, Kumar, Bagchi and Sriskandarajah (2000) extended the approach presented by Sriskandarajah and Wagneur (1999) to the m-machine case. Later, Kalir and Sarin (2001) proposed a bottleneck minimal idleness heuristic to sequence a set of batches to be processed in equal sub-lots for minimizing makespan. Yoon and Ventura (2002b) developed sixteen pairwise interchange methods to optimize the mean weighted absolute deviation from due dates.…”

Section: Literature Reviewmentioning

confidence: 99%

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

Pan

Ruíz

2012

Omega

143

View full text Add to dashboard Cite

Lot-streaming flow shops have important applications in different industries including textile, plastic, chemical, semiconductor, and many others. This paper considers an n-job m-machine lot-streaming flow shop scheduling problem with sequence-dependent setup times under both the idling and no-idling production cases. The objective is to minimize the maximum completion time or makespan. To solve this important practical problem, a novel estimation of distribution algorithm (EDA) is proposed with a job permutation based representation. In the proposed EDA, an efficient initialization scheme based on the NEH heuristic is presented to construct an initial population with a certain level of quality and diversity. An estimation of a probabilistic model is constructed to direct the algorithm search towards good solutions by taking into account both job permutation and similar blocks of jobs. A simple but effective local search is added to enhance the intensification capability. A diversity controlling mechanism is applied to maintain the diversity of the population. In addition, a speed-up method is presented to reduce the computational effort needed for the local search technique and the NEH-based heuristics. A comparative evaluation is carried out with the best performing algorithms from the literature. The results show that the proposed EDA is very effective in comparison after comprehensive computational and statistical analyses.

show abstract

“…These were first studied in an m/1/E problem, where setup times were considered (Truscott, 1985). Later on a bottleneck minimal idleness heuristic (BMI) was developed to generate solutions that were very close to the optimum (Kalir & Sarin, 2001). For the m/N/E problem, the BMI model was extended to n jobs but it did not consider setup times on it (Kalir & Sarin, 2001).…”

Section: Lot Streaming In M-stage Flow Shopmentioning

confidence: 99%

“…Later on a bottleneck minimal idleness heuristic (BMI) was developed to generate solutions that were very close to the optimum (Kalir & Sarin, 2001). For the m/N/E problem, the BMI model was extended to n jobs but it did not consider setup times on it (Kalir & Sarin, 2001). Other paper used integer programming to determine optimum sublot sizes while enumerating the number of sublots for an n jobs problem using discrete values (Huq, Cutright & Martin, 2004).…”

Section: Lot Streaming In M-stage Flow Shopmentioning

confidence: 99%

A review of lot streaming in a flow shop environment with makespan criteria

Gómez-Gasquet

Segura-Andrés

Romano

2013

JIEM

View full text Add to dashboard Cite

Abstract:Purpose: This paper reviews current literature and contributes a set of findings that capture the current state-of-the-art of the topic of lot streaming in a flow-shop.Design/methodology/approach: A literature review to capture, classify and summarize the main body of knowledge on lot streaming in a flow-shop with makespan criteria and, translate this into a form that is readily accessible to researchers and practitioners in the more mainstream production scheduling community. Findings:The existing knowledge base is somewhat fragmented. This is a relatively unexplored topic within mainstream operations management research and one which could provide rich opportunities for further exploration.Originality/value: This paper sets out to review current literature, from an advanced production scheduling perspective, and contributes a set of findings that capture the current state-of-the-art of this topic.

show abstract

A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots

Cited by 63 publications

References 9 publications

Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine

Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

A review of lot streaming in a flow shop environment with makespan criteria

Contact Info

Product

Resources

About