An Efficient Relax-and-Solve Heuristic for Open-Shop Scheduling Problem to Minimize Total Weighted Earliness-Tardiness

Ahmadian, Mohammad Mahdi; Salehipour, Amir; Kovalyov, Mikhail Y.

doi:10.2139/ssrn.3601396

Cited by 6 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we propose an R&S matheuristic algorithm for solving problem

1|(a_j, L_j, b_j)|C_{\max }

. The R&S has been shown to deliver quality solutions for challenging scheduling problems (Ahmadian et al., 2020; Khatami and Salehipour, 2020; Ahmadian and Salehipour, 2021; Ahmadian et al., 2021; Ahmadian and Salehipour, 2022). The operation of the R&S algorithm is similar to that of the fix‐and‐optimize algorithm of Helber and Sahling (2010).…”

Section: The Solution Methodsmentioning

confidence: 99%

The coupled task scheduling problem: an improved mathematical program and a new solution algorithm

Khatami

Salehipour

2022

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

The general single machine coupled task scheduling problem with the objective function of minimizing the makespan, which is strongly NP‐hard, aims to schedule a set of coupled task jobs on one machine such that the completion time of the last job is minimized. We propose a new mixed‐integer program (MIP) for the problem. We also propose a relax‐and‐solve (R&S) matheuristic algorithm as the solution method. We show that the new MIP outperforms the available models and improves the quality of solutions. Also, the proposed MIP significantly improves the average gap to the best known feasible solution of an existing binary search algorithm. We show that our R&S matheuristic produces new best solutions for almost 50% of the instances.

show abstract

“…In this section, we propose an R&S matheuristic algorithm for solving problem

1|(a_j, L_j, b_j)|C_{\max }

Section: The Solution Methodsmentioning

confidence: 99%

The coupled task scheduling problem: an improved mathematical program and a new solution algorithm

Khatami

Salehipour

2022

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

show abstract

“…In this section we propose an efficient relax-andsolve (R&S) heuristic algorithm for the ordered flow-shop scheduling problem. The R&S algorithm was designed by [9,10,11,12]. Given an initial sequence, the R&S algorithm obtains an improved solution through iterative relaxation of a subset (of the given sequence) of operations, and solving the subset, i.e., re-ordering and re-scheduling by using optimization techniques.…”

Section: The Proposed Relax-and-solve Methodsmentioning

confidence: 99%

A Relax-and-Solve Algorithm for the Ordered Flow-Shop Scheduling Problem

Khatami

Salehipour

2020

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

Self Cite

View full text Add to dashboard Cite

In the ordered flow-shop scheduling problem the processing times follow specific structures. We propose a relax-and-solve matheuristic for the ordered flow-shop problem to minimize the makespan, which is proven to be NPhard. We compare the performance of our method and that of the state-of-the-art methods, and show that the proposed method is capable of reporting new best solutions for a large number of instances, and has the average gap of as low as 0.046% from the best known solutions.

show abstract

“…Naderi et al [5] proposed four heuristic rules to remove redundant solutions generated in the algorithm process. Mohammad et al [6] proposed an efficient relaxation solution heuristic algorithm to solve OSSP for minimizing jobs' total weighted advance/delay. However, heuristic algorithms cannot guarantee the optimal solution or approximate the optimal solution every time.…”

Section: Introductionmentioning

confidence: 99%

Research Survey on Open Shop Scheduling Strategies Based on Intelligent Algorithms

2022

Proceedings of WCSE 2022 Spring Event: 2022 9th International Conference on Industrial Engineering and Applications

View full text Add to dashboard Cite

Open shop scheduling problem (OSSP) is one of the fundamental scheduling problems. Many scenarios such as vehicle maintenance, the medical system, and food processing can be modeled as OSSP in production and life. Therefore, this problem has essential application value and research significance. With the rapid development of artificial intelligence, the research of intelligent algorithms has increased explosively. Genetic algorithms, swarm intelligence algorithms, and artificial neural networks are several important intelligent algorithms that can solve OSSP. This paper summarizes the OSSP based on intelligent algorithms. Firstly, it briefly introduces the intelligent algorithm and OSSP. Then, the research on evolutionary algorithms and swarm intelligence algorithms to solve the OSSP is classified and summarized. Finally, the current algorithms for solving the problem are analyzed and discussed, the problems not solved by the existing algorithms are proposed. Furthermore, the development direction of intelligent algorithms for OSSP has been prospected.

show abstract

An Efficient Relax-and-Solve Heuristic for Open-Shop Scheduling Problem to Minimize Total Weighted Earliness-Tardiness

Cited by 6 publications

References 0 publications

The coupled task scheduling problem: an improved mathematical program and a new solution algorithm

The coupled task scheduling problem: an improved mathematical program and a new solution algorithm

A Relax-and-Solve Algorithm for the Ordered Flow-Shop Scheduling Problem

Research Survey on Open Shop Scheduling Strategies Based on Intelligent Algorithms

Contact Info

Product

Resources

About