A two-machine flowshop problem with two agents

Lee, Wen‐Chiung; Chen, Shiuan-Kang; Chen, Cheng-Wei; Wu, Chin‐Chia

doi:10.1016/j.cor.2010.04.002

Cited by 50 publications

(19 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lee et al [12] study a two-machine flow shop problem with two agents where the objective is to minimize the total completion time of first agent with no tardy jobs for the second agent. Lee et al [13] consider two-agent two-machine flow shop scheduling problem and develop a BB algorithm and simulated annealing (SA) to minimize the total tardiness of the first agent with no tardy jobs for the second agent.…”

Section: Introductionmentioning

confidence: 99%

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

Lei

2015

Applied Soft Computing

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

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

Lei

2015

Applied Soft Computing

View full text Add to dashboard Cite

“…Lee et al (2009) focused on minimizing the total weighted completion time and introduced fully polynomialtime approximation schemes and an efficient approximation algorithm with a reasonable worst-case bound. Considering the two-machine flowshop setting with two agents, Lee et al (2010Lee et al ( , 2011 proposed a branch-and-bound algorithm and a simulated annealing heuristic to search for the optimal solution and near-optimal solutions, respectively. Leung et al (2010) generalized the single-machine problems proposed by Agnetis et al (2004) by including total tardiness in the objective function and considering jobs with different release dates and preemptions in a scheduling environment with parallel identical machines.…”

Section: Introductionmentioning

confidence: 99%

A two-agent single-machine scheduling problem to minimize the total cost with release dates

Wang

Yin

et al. 2015

Soft Comput

Self Cite

View full text Add to dashboard Cite

This paper considers a two-agent scheduling problem with arbitrary release dates on a single machine. The cost of the first agent is the maximum weighted completion time of its jobs while the cost of the second agent is the total weighted completion time of its jobs. The goal is to schedule the jobs such that the total cost of the two agents is minimized. The problem is known to be strongly NP-hard. Thus, as an alternative, a branch-and-bound algorithm incorporating several dominance properties and a lower bound is provided to derive the optimal solution and a largest-order-value method combined with proposed three initials is developed to derive the near-optimal solutions for the problem. Computational results are also presented to evaluate the performance of the proposed algorithms.

show abstract

“…To evaluate the effectiveness of the provided procedures for solving the problem, the number of instances was considered based on the study of Lee et al (2010), Lee et al (2011) and Yin et al (2012ab). For all instances, the processing times of the first agent's jobs and second agent's jobs were randomly generated from a uniform distribution on the interval [1,10].…”

Section: Instancesmentioning

confidence: 99%

“…They proposed a branch and bound algorithm and a simulated annealing algorithm and claimed that the branch and bound algorithm can solve problems involving up to 15 jobs in size in a reasonable amount of time. Lee et al (2011) considered a two-agent scheduling problem in the two-machine flowshop, where the objective was to minimize the total completion time of the first agent's jobs with the restriction that the number of tardy jobs of the second agent is zero. They presented a branch and bound and a simulated annealing procedure to solve the problem, and showed that the branch and bound algorithm is capable of solving instances containing up to 20 jobs in size in a reasonable amount of time.…”

Section: Introductionmentioning

confidence: 99%

A two-agent scheduling problem in a two-machine flowshop

Ahmadi-Darani¹,

Moslehi²,

Reisi–Nafchi³

2018

10.5267/j.ijiec

View full text Add to dashboard Cite

In recent years, many studies on the multi-agent scheduling problems in which agents compete for using the shared resources, have been performed. However, relatively few studies have been undertaken in the field of the multi-agent scheduling in a flowshop environment. To bridge the gap, this paper aims at addressing the two-agent scheduling problem in a two-machine flowshop. Because of the importance of delay penalties and efficient resource utilization in many manufacturing environments, the objective is to find an optimal schedule which has the minimum total tardiness for the first agent's jobs, under the makespan limitation for the second agent. Since this problem is strongly NP-hard, several theorems and properties of the problem are proposed to apply in exact and meta-heuristic methods. Also, for some instances of the problem for which exact methods cannot achieve optimal solutions in a reasonable amount of time, a tabu search algorithm is developed to achieve near-optimal solutions. Computational results of the tabu search algorithm show that the average absolute error value is lower than 0.18 percent for instances with 20 to 60 jobs in size.

show abstract

A two-machine flowshop problem with two agents

Cited by 50 publications

References 31 publications

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

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

A two-agent single-machine scheduling problem to minimize the total cost with release dates

A two-agent scheduling problem in a two-machine flowshop

Contact Info

Product

Resources

About