A tabu method for a two-agent single-machine scheduling with deterioration jobs

Minimizing total weighted completion time under makespan constraint for two-agent scheduling with job-dependent aging effects

“…Liu, Zhou, and Tang (2010), Lee, Wang, Shiau, and Wu (2010), Liu, Yi, and Zhou (2011), and Wu et al (2013) investigated linear function-based approaches to compute actual processing times, whereas ), Wu, Huang, and Lee (2011), and Li and Hsu (2012 applied exponential function-based approaches. Furthermore, some further approaches assume that the actual processing time depends on the sum of the processing times of the jobs processed previously (Cheng, Cheng, Wu, Hsu, & Wu, 2011;Liu, Yi, Zhou, & Gong, 2013;Wu, 2014).…”

A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents

“…Yin and his partners carry out some related works on two-agent problem in single machine (Wu et al 2013;Yin et al 2012;Wang et al, 2015). They provide complexity results for two-agent problems with due date determination, propose a BB algorithm and a marriage in honey bees optimization algorithm for the problem with ready times and present a GA for the problem with learning effects.…”

“…Liu, Yi, Zhou, and Gong (2013) discuss the optimal properties of two-agent scheduling with sum-ofprocessing-times-based deterioration and present some polynomial time algorithms. Wu et al (2013) propose branch-and-bound (BB) algorithm and tabu search for two-agent problem with deterioration jobs.…”

Two-phase neighborhood search algorithm for two-agent hybrid flow shop scheduling problem

“…Wu et al [8] propose a branch-and-bound (BB) algorithm and a tabu search (TS) for two-agent single-machine scheduling with deterioration jobs.…”