A heuristic algorithm to minimize total weighted tardiness on a single machine with release times

Abstract

This paper attempts to solve a single machine‐scheduling problem, in which the objective function is to minimize the total weighted tardiness with different release dates of jobs. To address this scheduling problem, a heuristic scheduling algorithm is presented. A mathematical programming formulation is also formulated to validate the performance of the heuristic scheduling algorithm proposed herein. Experimental results show that the proposed heuristic algorithm can solve this problem rapidly and accurately. Overall, this algorithm can find the optimal solutions for 2200 out of 2400 randomly generated problems (91.67%). For the most complicated 20 job cases, it requires less than 0.0016 s to obtain an ultimate or even optimal solution. This heuristic scheduling algorithm can therefore efficiently solve this kind of problem.

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

“…Wan and Yen (2002), Behnamian et al (2009), Arroyo et al (2011), Ribeiro et al (2010), Rosa et al (2017), and Jing et al (2020) addressed theoretically and algorithmically the problem of minimizing earliness and tardiness scheduling with due windows. However, they did not consider the release date, one of the indispensable features in practice (Chou et al, 2005;Mrad et al, 2019). To the best of our knowledge, only Yoo and Martin-Vega (2001) and Janiak et al (2009) examined the JIT scheduling problem with due windows and release dates.…”

“…(2020) addressed theoretically and algorithmically the problem of minimizing earliness and tardiness scheduling with due windows. However, they did not consider the release date, one of the indispensable features in practice (Chou et al., 2005; Mrad et al., 2019). To the best of our knowledge, only Yoo and Martin‐Vega (2001) and Janiak et al.…”

Logistic system design of an underground freight pipeline system||Logistic system design of an underground freight pipeline system

“…According to this concept, when one capsule finishes its delivery task and leaves the pipe line, the heuristic must decide which task among the on-hand WIP has the top priority to be processed next. Chou, et al (2005) proposed a heuristic algorithm to minimize total weight tardiness on a single machine with release times which is similar to this problem which seeks to find a schedule that minimizes the total tardiness square. In order to modify this algorithm the freight pipe line must be considered as a machine by which the transportation tasks are processed However, since the freight pipe line only allows a certain number of capsules in it at any time, this virtual "machine" has multiple processors.…”