An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine

Le, Hoang Thanh; Geser, Philine; Middendorf, Martin

doi:10.1007/978-3-030-16711-0_4

Cited by 7 publications

(6 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Equation ( 14) represents the process route constraint of the product; Equation (15) provides the exclusive constraint of the device; Equation ( 16) represents the consistency constraint of a single processing; Equation (17) gives the BOM structure constraint of the product; Equation (18) represents the processing cycle constraint of the product.…”

Section: End Time Of Product P Imentioning

confidence: 99%

“…Ziaee [17] studied the job scheduling problem in a distributed manufacturing environment and proposed a fast heuristic algorithm based on the construction procedure. Le, Geser, and Middendorf [18] studied a special case of two-machine flow shop scheduling problems with buffers and proposed two specific heuristics: a modification of the commonly used NEH heuristic and an iterated local search heuristic. Variable neighborhood search (VNS) was used to improve the efficiency and the quality of the final solution.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route

2021

View full text Add to dashboard Cite

For the scheduling problem of complex products in multi-workshop production, this paper studied the BOM (Bill of Materials) structure of complex products and the characteristics of the process route and developed the construction method of a multi-level process network diagram. Based on this, a comprehensive mathematical model for scheduling on multi-workshop production was proposed. An improved particle swarm algorithm (PSO) was proposed to solve the problem. By constructing the network subgraph, the invalid search path of the algorithm was avoided, and the efficiency of the algorithm was improved. In addition, for the scheduling problem with product time constraints, this paper presented a path search rescheduling strategy to ensure that the algorithm could obtain an effective search path. Finally, the model and algorithm were verified through a case study. This paper optimized the parameters of the algorithm by different tests and obtained the optimal range of the parameters. At the same time, through the analysis of the scheduling of complex products in a multi-workshop environment, the effectiveness and practicability of the above methods were verified.

show abstract

Section: End Time Of Product P Imentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route

2021

View full text Add to dashboard Cite

show abstract

“…Note that this paper is an extension of (Le et al, 2019). New is a detailed NPcompleteness proof for the considered problems and the identification of the aforementioned efficiently solvable subcases by presenting an O(n log n) algorithm and proving its correctness.…”

Section: Introductionmentioning

confidence: 99%

Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine

Geser

Middendorf

2021

Evolutionary Computation

Self Cite

View full text Add to dashboard Cite

The two-machine permutation flow shop scheduling problem with buffer is studied for the special case that all processing times on one of the two machines are equal to a constant c. This case is interesting because it occurs in various applications, e.g., when one machine is a packing machine or when materials have to be transported. Different types of buffers and buffer usage are considered. It is shown that all considered buffer flow shop problems remain NP-hard for the makespan criterion even with the restriction to equal processing times on one machine. However, the special case where the constant c is larger or smaller than all processing times on the other machine is shown to be polynomially solvable by presenting an algorithm (2BF-OPT) that calculates optimal schedules in [Formula: see text] steps. Two heuristics for solving the NP-hard flow shop problems are proposed: i) a modification of the commonly used NEH heuristic (mNEH) and ii) an Iterated Local Search heuristic (2BF-ILS) that uses the mNEH heuristic for computing its initial solution. It is shown experimentally that the proposed 2BF-ILS heuristic obtains better results than two state-of-the-art algorithms for buffered flow shop problems from the literature and an Ant Colony Optimization algorithm. In addition, it is shown experimentally that 2BF-ILS obtains the same solution quality as the standard NEH heuristic, however, with a smaller number of function evaluations.

show abstract

“…Moreover, it remains NPhard in the strong sense even under the restriction that the order in which the jobs should be processed on one of the machines is given [12]. According to [13] the makespan minimisation problem is also NP-hard in the following two cases: when all jobs have the same processing time on the second-stage machine and the buffer requirement of a job is proportional to its processing time on the first-stage machine, and in the case when all jobs have the same processing time on the second-stage machine and the same buffer requirements.…”

Section: Introductionmentioning

confidence: 99%

“…The case where all jobs have the same processing time on one of the machines, or the same processing time on the first-stage machine and the same processing time on the second-stage machine was considered in a number of publications, including [2,9] and the mentioned above [13]. Besides the theoretical interest, this case has applications in star data gathering networks where different workstations are allocated datasetindependent time slots for data transfer, and in unloading and loading involving a crane.…”

Section: Introductionmentioning

confidence: 99%

Two-machine flow shop with dynamic storage space

2020

View full text Add to dashboard Cite

The publications on two-machine flow shop scheduling problems with job dependent storage requirements, where a job seizes a portion of the storage space for the entire duration of its processing, were motivated by various applications ranging from supply chains of mineral resources to multimedia systems. In contrast to the previous publications that assumed that the availability of the storage space remains unchanged, this paper is concerned with a more general case when the availability is a function of time. It strengthens the previously published result concerning the existence of an optimal permutation schedule, shows that the variable storage space availability leads to the NP-hardness in the strong sense even for unit processing times, and presents a polynomial-time approximation scheme together with several heuristic algorithms. The heuristics are evaluated by means of computational experiments.

show abstract

An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine

Cited by 7 publications

References 27 publications

A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route

A Scheduling Algorithm for Multi-Workshop Production Based on BOM and Process Route

Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine

Two-machine flow shop with dynamic storage space

Contact Info

Product

Resources

About