Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing

Manjeshwar, Praveen Kumar; Damodaran, Purushothaman; Srihari, K.

doi:10.1016/j.rcim.2008.05.003

Cited by 51 publications

(17 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was shown that this problem is NP-hard in ordinary sense and three heuristics were presented to minimize this objective. For the same problem, Liao and Liao [23] improved their formulations and Manjeshwar et al [28] and Manjeshwar et al [28] have proposed metaheuristic algorithms. But, as is mentioned, the number of processors in an assembly line varies from one to m. Recently, scheduling problem with batch processors has attracted many researchers in both theoretical and practical areas.…”

Section: Related Literaturementioning

confidence: 99%

Scheduling of printed circuit board (PCB) assembly systems with heterogeneous processors using simulation-based intelligent optimization methods

Noroozi

Mokhtari

2014

Neural Comput & Applic

View full text Add to dashboard Cite

The complexity of printed circuit boards (PCBs), as an important sector of the electronics manufacturing industry, has increased over the last three decades. This paper focuses on a practical application observed at a PCB assembly line of electronics manufacturing facility. It is shown that this problem is equivalent to a flowshop scheduling with multiple heterogeneous batch processors where processors can perform multiple tasks as long as the sizes of jobs in a batch do not violate the processors' capacity. The equivalent problem is mathematically formulated as a mixed integer programming model. Then, a Monte Carlo simulation is incorporated into high-level genetic algorithm-based intelligent optimization techniques to assess the performance of makespan-oriented system under uncertain processing times. At each iteration of algorithm, the output of simulator is used by optimizers to provide online feedbacks on the progress of the search and direct the search toward a promising solution zone. Furthermore, various parameters and operators of the algorithm are discussed and calibrated by means of Taguchi statistical technique. The result of extensive computational experiments shows that the solution approach gives high-quality solutions in reasonable computational time.

show abstract

Section: Related Literaturementioning

confidence: 99%

Scheduling of printed circuit board (PCB) assembly systems with heterogeneous processors using simulation-based intelligent optimization methods

Noroozi

Mokhtari

2014

Neural Comput & Applic

View full text Add to dashboard Cite

show abstract

“…The BPMs are encountered in many different environments such as chemical processes performed in tanks or kilns and burn-in operations in semiconductor industry. Problems related with scheduling BPMs has been received much attention in scheduling literature in recent years -see Lee et al (1992), Uzsoy (1994), Li (1997), Brucker et al (1998), Lee & Uzsoy (1999), Damodaran & Srihari (2004), Mathirajan & Sivakumar (2006), Damodaran et al (2007) and Manjeshwar et al (2009)-. Results of these researches are relevant to the HFS, although refer to the single BPM, parallel BPMs, or flow shop BPMs. Uzsoy (1994) described an application for burn-in operations in semiconductor manufacturing.…”

Section: Wwwintechopencommentioning

confidence: 99%

“…Uzsoy (1994) described an application for burn-in operations in semiconductor manufacturing. In papers of Damodaran et al (2007), Liao & Huang (2008), Manjeshwar et al (2009), it have been provided applications of BPMs in the chemical treatment stage in rim (for bike) manufacturing facilities and in chambers for the environmental stress screening in the printed circuit board assembly environment, respectivelly.…”

Section: Wwwintechopencommentioning

confidence: 99%

Lot Processing in Hybrid Flow Shop Scheduling Problem

Burtseva¹,

Romero²,

Ramirez³

et al. 2012

Production Scheduling

View full text Add to dashboard Cite

“…It is hard to perform a fair comparison of our algorithm with published algorithms since they have been developed for models which differ too much from the one we consider. For example, the heuristics for a flow-shop model with batching machines often deal with batches of unequal size, see, e.g., [17,18,20,23,24]; the production-transportation papers often consider nonidentical vehicles [29] and take into account the routing issues [9]. Due to this reason, we also pay special attention to lower bound calculations and estimate the quality of our tabu search algorithm with respect to the calculated lower bound values.…”

Section: Introductionmentioning

confidence: 99%

Tabu search and lower bounds for a combined production–transportation problem

Condotta

Knust

Meier

et al. 2013

Computers & Operations Research

View full text Add to dashboard Cite

In this paper we consider a combined production-transportation problem, where n jobs have to be processed on a single machine at a production site before they are delivered to a customer. At the production stage, for each job a release date is given; at the transportation stage, job delivery should be completed not later than a given due date. The transportation is done by m identical vehicles with limited capacity. It takes a constant time to deliver a batch of jobs to the customer. The objective is to find a feasible schedule minimizing the maximum lateness.After formulating the considered problem as a mixed integer linear program, we propose different methods to calculate lower bounds. Then we describe a tabu search algorithm which enumerates promising partial solutions for the production stage. Each partial solution is complemented with an optimal transportation schedule (calculated in polynomial time) achieving a coordinated solution to the combined productiontransportation problem. Finally, we present results of computational experiments on randomly generated data.

show abstract

Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing

Cited by 51 publications

References 25 publications

Scheduling of printed circuit board (PCB) assembly systems with heterogeneous processors using simulation-based intelligent optimization methods

Scheduling of printed circuit board (PCB) assembly systems with heterogeneous processors using simulation-based intelligent optimization methods

Lot Processing in Hybrid Flow Shop Scheduling Problem

Tabu search and lower bounds for a combined production–transportation problem

Contact Info

Product

Resources

About