Flowshop scheduling problem with a batching machine and task compatibilities

Oulamara, Ammar; Finke, Gerd; Kuiteing, Aimé Kamgaing

doi:10.1016/j.cor.2007.10.006

Cited by 34 publications

(10 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on their work, Malve and Uzsoy [27] proposed several GAs incorporating with some heuristics in some previous works. Oulamara et al [37] have studied a two processor problem that involved a discrete and batch processor. Mönch et al [32] investigated two different approaches for scheduling jobs with incompatible job families and unequal ready times on parallel batch processors and developed genetic algorithms to minimize the total weighted tardiness criterion.…”

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

“…In For processing time of jobs on machines, two levels including small (uniform [1,10]) and large (uniform [10,20]) are selected. For the size of jobs, two levels including small (uniform [1,4]) and large (uniform [4,8]) are selected.…”

Section: Experimentationsmentioning

confidence: 99%

“…Oulamara et al [20] and Liao and Liao [21] investigated problem of tasks scheduling in a flowshop with two BPMs. They considered the makespan objective and presented heuristic approaches to solve it.…”

Section: Introductionmentioning

confidence: 99%

The openshop batch processing problem with non-identical processing times, using simulated annealing and genetic algorithms approaches

Khormali¹,

Mirzazadeh²,

Faez³

2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

This paper addresses batch processing problem on the multimachine openshop. In the batch processing problem, jobs are categorized into batches and the batches are processed by machines. The processing time of each batch equals the maximum processing time of the batch jobs. The objective is to minimize the makespan. We assume non-identical processing time jobs. We used metaheuristic algorithms, including simulated annealing and genetic algorithms to solve the problem. Several numerical experiments show that for the small size problems, the proposed methods generate the solutions by no deviation or a little deviation from the global optimum. Furthermore, for the large-size problems, the proposed methods generate better solutions in a few times as compared to the commercial optimization software Lingo 8.

show abstract

“…The H-FCBLPT heuristic starts by constructing a list of batches with minimal total processing times (Oulamara et al [8]). The second step of the heuristic is identical to the heuristic for parallel batching machines presented by Lee et al [17], with a ratio of ( 4…”

Section: Lemmamentioning

confidence: 99%

“…They offered a polynomial algorithm for the problem of minimizing batch completion time, when both batching machines can process an unbounded number of tasks in the same batch, and proved the NP-hardness of this problem when at least one of the machines can process up to k tasks in the same batch k < n. Oulamara et al [8] consider the two-machine flowshop problem where the first machine is a discrete machine and the second is a batching machine. The objective is to minimize the makespan.…”

Section: Introductionmentioning

confidence: 99%

Scheduling hybrid flowshop with parallel batching machines and compatibilities

Bellanger

Oulamara

2009

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

This paper considers a two-stage hybrid flowshop problem in which the first stage contains several identical discrete machines, and the second stage contains several identical batching machines. Each discrete machine can process no more than one task at time, and each batching machine can process several tasks simultaneously in a batch with the additional feature that the tasks of the same batch have to be compatible. A compatibility relation is defined between each pair of tasks, so that an undirected compatibility graph is obtained which turns out to be an interval graph. The batch processing time is equal to the maximal processing time of the tasks in this batch, and all tasks of the same batch start and finish together. The goal is to make batching and sequencing decisions in order to minimize the makespan. Since the problem is NP-hard, we develop several heuristics along with their worst cases analysis. We also consider the case in which tasks have the same processing time on the first stage, for which a polynomial time approximation scheme (PTAS) algorithm is presented.

show abstract

Flowshop scheduling problem with a batching machine and task compatibilities

Cited by 34 publications

References 8 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

The openshop batch processing problem with non-identical processing times, using simulated annealing and genetic algorithms approaches

Scheduling hybrid flowshop with parallel batching machines and compatibilities

Contact Info

Product

Resources

About