Efficient heuristic and optimal approaches for n/2/F/σCi scheduling problems

Two-machine flow shop problem with effects of deterioration and learning

“…The procedure is adapted from the results in Wang, Chu, and Proth (1996) and Lee and Wu (2004). Wang et al (1996) proposed three heuristic algorithms for the problem under study in this paper when there are no deteriorating jobs. The first method focused on avoiding or reducing idle time on the second machine.…”

Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration

“…For the literature on flow shop scheduling problems without deteriorating jobs, the reader is referred to papers Ignall and Schrage [28], Ho and Gupta [29], Croce et al [30], Wang et al [31], Hoogeveen and Kawaguchi [32], Croce et al [33], Chung et al [34], Pinedo [35], Lee and Wu [36], Wang et al [37], Cheng et al [38], Wang [39], and Easwaran et al [40].…”

A two-machine flowshop problem with two agents

“…Cadambi and Sathe [20] presented some dominance rules, but the computational results were not studied until Pan and Wu [21]. Wang et al [22] proposed three heuristic algorithms to find near-optimal schedules and provided some dominance properties to further improve the efficiency of the branch-and-bound algorithm. They also compared the proposed heuristic algorithms and their respective lower bounds.…”