Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches

Uric acid as a risk factor for progression of non-diabetic chronic kidney disease? The Mild to Moderate Kidney Disease (MMKD) Study

“…The average computation time (CPU time in seconds) of the proposed RBS algorithm run on a Pentium 4 (2.4GHz) PC and that of the five different meta-heuristics (FDM) proposed by Feldmann and Biskup (2003) run on a Pentium 90 PC are presented…”

“…On the other hand, if a common due date is given and may influence the optimal sequence of the jobs, it is called restrictive. Therefore, a search for an optimal sequence of the jobs has to be carried out with respect to the due date (Feldmann & Biskup, 2003).…”

“…Such instances might occur if a customer orders different variations of a product, all of which must be delivered in the same truck or container ship for transportation cost saving (Sule, 1997), or if a firm has installed a weekly bulk delivery to the wholesaler (Feldmann & Biskup, 2003). A survey of US manufacturing practitioners reveals that meeting a restrictive common due date is one of the most important scheduling criteria (Wisner & Siferd, 1995).…”

“…Researchers developed polynomially or pseudo-polynomially solvable algorithms for special cases where conditions for i α and i β are imposed (Cheng & Gupta, 1989;Hall et al, 1991;Hoogeveen & van de Velde, 1991;Kahlbacher, 1993). Studies employing meta-heuristics (Lee & Kim, 1995;James, 1997;Feldmann & Biskup, 2003;Hino et al, 2005) and dealing with this argument are even more recent. These recent published meta-heuristics do provide excellent results, but in some cases these meta-heuristics are so intricate that independent coding is unlikely to lead to the same effectiveness or efficiency.…”

A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times

“…Gagne et al (2002) developed an ACO algorithm for the single machine scheduling problem with sequence-dependent setup times. Feldmann and Biskup (2003) solved the single machine scheduling problems by evolutionary strategy, SA and threshold accepting approaches to minimise the weighted sum of earliness and tardiness. Liao and Juan (2007) developed an ACO algorithm.…”