A survey of intelligent algorithms for open shop scheduling problem

Huang, Zizhao; Zhuang, Zilong; Cao, Qi; Lu, Zhiyao; Guo, Liangxun; Qin, Wei

doi:10.1016/j.procir.2019.04.118

Cited by 11 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The analysed problem should therefore be defined as the scheduling of tasks on a single machine in an open-shop environment. This is because open-shop scheduling is characterized by a lack of a specific order of jobs, which is very common during the execution of jobs in the electronics or computer industries [37]. In the robotic adhesive dispensing scheduling process under study, individual jobs consist of making connections of a given element, which will combine appropriate auxiliary and effective movements of the robot.…”

Section: Mathematical Model Of the Analysed Problemmentioning

confidence: 99%

A Lean Robotics Approach to the Scheduling of Robotic Adhesive Dispensing Process

Sobaszek¹

2022

Adv. Sci. Technol. Res. J.

View full text Add to dashboard Cite

Modern implementations of industrial robots require the use of extensive knowledge and novel concepts. To bring real benefits, robotized processes must be analysed in detail. One can now observe an increasing use of lean robotics, a concept that is primarily intended to simplify processes and eliminate inefficient activities. This paper deals with industrial robot task scheduling in the adhesive dispensing process. The first part of the paper presents the modern concept of production process robotisation and reviews the literature on industrial robot task scheduling. After that, the problem of robotic adhesive dispensing on the electronic components of a printed circuit board (PCB) is presented. Another section of the paper describes the scheduling of effective and supporting tasks of the robot in the analysed process with the use of alternative dispatching rules. The determination of a schedule that is optimal in terms of the defined objective made it possible to discuss the results and reach valid conclusions. The study has confirmed that modern concepts are useful for simplifying robotic production processes.

show abstract

Section: Mathematical Model Of the Analysed Problemmentioning

confidence: 99%

A Lean Robotics Approach to the Scheduling of Robotic Adhesive Dispensing Process

Sobaszek¹

2022

Adv. Sci. Technol. Res. J.

View full text Add to dashboard Cite

show abstract

“…After applying the mutation and crossover operators, to guarantee the improvement of individuals in each generation, the generated trials will be transferred to a new generation if and only if they improve the current generation. The selection procedure is defined in (5) where indicates the fitness of Z and G refers to the current generation.…”

Section: Selectionmentioning

confidence: 99%

“…Hence, applying approximation approaches can be more effective than exact methods. Huang et al [5] proposed four algorithms including GA, Particle Swarm Optimization (PSO), cuckoo search algorithm, and Ant Colony Optimization (ACO) for OSSP. DE is another well-known algorithm that has rarely been implemented for OSSP; however, there are some studies using this algorithm to other scheduling problems, such as parallel machines [6].…”

Section: Introductionmentioning

confidence: 99%

Non-Preemptive Open Shop Scheduling Considering Machine Availability

Barjouei

Barabadi

Tavakkoli–Moghaddam

2019

2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

View full text Add to dashboard Cite

This paper considers a non-preemptive open shop scheduling problem (OSSP), in which machines are not available to process jobs on known periodic interval times resulted from periodic service repair, rest period, and so on. Asymmetric transportation time between machines is considered, which can be different from one job to another. The objective is to minimize the weighted mean completion time (WMCT). Since the problem is categorized into NP-hard class, two meta-heuristic algorithms including genetic algorithm (GA) and differential evolution (DE) are proposed. Meanwhile, a new initial population is introduced, which significantly improves the performance of the algorithms. Finally, the performance of the algorithms is validated through some large-sized instances and the results are discussed.

show abstract

A Mixed-Integer Linear Model for Solving the Open Shop Scheduling Problem

Morillo-Torres

Gatica

2021

Service Oriented, Holonic and Multi-Agent Manufacturing Systems for Industry of the Future

View full text Add to dashboard Cite

A survey of intelligent algorithms for open shop scheduling problem

Cited by 11 publications

References 15 publications

A Lean Robotics Approach to the Scheduling of Robotic Adhesive Dispensing Process

A Lean Robotics Approach to the Scheduling of Robotic Adhesive Dispensing Process

Non-Preemptive Open Shop Scheduling Considering Machine Availability

A Mixed-Integer Linear Model for Solving the Open Shop Scheduling Problem

Contact Info

Product

Resources

About