Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

Zhao, Ning; Ye, Song; Li, Kaidian; Chen, Siyu

doi:10.1007/s10033-017-0108-2

Cited by 15 publications

(6 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper only uses the NIFSP to show the type 1 anomaly. The processing time of each operation is considered as (5,3,5), (5,3,5) and (5,3,3). It is easy to know that when the minimization of makespan is regarded as the objective function, the optimal schedule is J1, J2, J3, and the value is 25.…”

Section: Examples Of Anomalies In Special Pfspsmentioning

confidence: 99%

See 1 more Smart Citation

Anomalies in Special Permutation Flow Shop Scheduling Problems

Gui

Gao

2020

Chin. J. Mech. Eng.

View full text Add to dashboard Cite

Recent researches show that there are some anomalies, which are not satisfied with common sense, appearing in some special permutation flow shop scheduling problems (PFSPs). These anomalies can be divided into three different types, such as changing the processing time of some operations, changing the number of total jobs and changing the number of total machines. This paper summarizes these three types of anomalies showing in the special PFSPs and gives some examples to make them better understood. The extended critical path is proposed and the reason why these anomalies happen in special PFSPs is given: anomalies will occur in these special PFSPs when the time of the operations on the reverse critical path changes. After that, the further reason for these anomalies is presented that when any one of these three types of anomalies happens, the original constraint in the special PFSPs is destroyed, which makes the anomalies appear. Finally, the application of these anomalies in production practice is given through examples and also with the possible research directions. The main contribution of this research is analyzing the intial reason why the anomalies appear in special PFSPs and pointing out the application and the possible research directions of all these three types of anomalies.

show abstract

Section: Examples Of Anomalies In Special Pfspsmentioning

confidence: 99%

“…The permutation flow shop scheduling problem (PFSP), which has the same machine permutation to each job and the same job permutation to each machine [1-3], is a common type of flow shop scheduling problem [4,5]. Some other new types of shop scheduling problems will form if different constraints is added to it.…”

Section: Introductionmentioning

confidence: 99%

Anomalies in Special Permutation Flow Shop Scheduling Problems

Gui

Gao

2020

Chin. J. Mech. Eng.

View full text Add to dashboard Cite

show abstract

“…In mechanical manufacturing, production scheduling and transportation scheduling are two vital parts [5]. Optimizing both of them becomes a core task of advanced manufacturing and modern management, which not only allocates tasks but also affects the utilization level of resources and energy [6].…”

Section: Introductionmentioning

confidence: 99%

Integrated Production and Transportation Scheduling Method in Hybrid Flow Shop

Han

Gao

et al. 2022

Chin. J. Mech. Eng.

View full text Add to dashboard Cite

The connection between production scheduling and transportation scheduling is getting closer in smart manufacturing system, and both of those problems are summarized as NP-hard problems. However, only a few studies have considered them simultaneously. This paper solves the integrated production and transportation scheduling problem (IPTSP) in hybrid flow shops, which is an extension of the hybrid flow shop scheduling problem (HFSP). In addition to the production scheduling on machines, the transportation scheduling process on automated guided vehicles (AGVs) is considered as another optimization process. In this problem, the transfer tasks of jobs are performed by a certain number of AGVs. To solve it, we make some preparation (including the establishment of task pool, the new solution representation and the new solution evaluation), which can ensure that satisfactory solutions can be found efficiently while appropriately reducing the scale of search space. Then, an effective genetic tabu search algorithm is used to minimize the makespan. Finally, two groups of instances are designed and three types of experiments are conducted to evaluate the performance of the proposed method. The results show that the proposed method is effective to solve the integrated production and transportation scheduling problem.

show abstract

“…The greedy algorithm is used to obtainCUTBESTand the steps are as follows ( Tong et al., 2017 ; Zhao et al., 2017 ; Zhang et al., 2018 ). Firstly, find the set with the most elements in HC i ( i =1,2,… N ) and record its subscript i most .…”

Section: Introductionmentioning

confidence: 99%

Design of an efficient combined multipoint picking scheme for tea buds

Chen

et al. 2022

Front. Plant Sci.

View full text Add to dashboard Cite

Herein, a combined multipoint picking scheme was proposed, and the sizes of the end of the bud picker were selectively designed. Firstly, the end of the bud picker was abstracted as a fixed-size picking box, and it was assumed that the tea buds in the picking box have a certain probability of being picked. Then, the picking box coverage and the greedy algorithm were designed to make as few numbers of picking box set as possible to cover all buds to reduce the numbers of picking. Furthermore, the Graham algorithm and the minimum bounding box were applied to fine-tune the footholds of each picking box in the optimal coverage picking box set, so that the buds were concentrated in the middle of the picking boxes as much as possible. Moreover, the geometric center of each picking box was taken as a picking point, and the ant colony algorithm was used to optimize the picking path of the end of the bud picker. Finally, by analyzing the influence of several parameters on the picking performance of the end of the bud picker, the optimal sizes of the picking box were calculated successfully under different conditions. The experimental results showed that the average picking numbers of the combined multipoint picking scheme were reduced by 31.44%, the shortest picking path was decreased by 11.10%, and the average consumed time was reduced by 50.92% compared to the single-point picking scheme. We believe that the proposed scheme can provide key technical support for the subsequent design of intelligent bud-picking robots.

show abstract

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

Cited by 15 publications

References 34 publications

Anomalies in Special Permutation Flow Shop Scheduling Problems

Anomalies in Special Permutation Flow Shop Scheduling Problems

Integrated Production and Transportation Scheduling Method in Hybrid Flow Shop

Design of an efficient combined multipoint picking scheme for tea buds

Contact Info

Product

Resources

About