A note on the scheduling with two families of jobs

Yuan, Jinjiang; Shang, Weiping; Qi, Feng

doi:10.1007/s10951-005-4997-z

Cited by 83 publications

(29 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper seeks to present general methods to treat the single-machine multi-agent scheduling problem. The results presented in this paper embrace some of the results on single-machine two-agent scheduling reported in the literature (Agnetis et al (2004), Baker and Smith (2003), and Yuan et al (2005)). …”

Section: Introduction and Problem Formulationsupporting

confidence: 68%

“…The following observation, which holds for two-agent scheduling (see Baker and Smith (2003), and Yuan et al (2005)), still holds for multi-agent scheduling.…”

Section: Polynomial-time Algorithms For Special Modelsmentioning

confidence: 86%

“…The idea in this paper comes partially from Agnetis et al (2004), Baker and Smith (2003), and Yuan et al (2005). This paper is organized as follows.…”

Section: Introduction and Problem Formulationmentioning

confidence: 99%

See 2 more Smart Citations

Multi-agent scheduling on a single machine with max-form criteria

Cheng

Yuan

2008

European Journal of Operational Research

150

View full text Add to dashboard Cite

Abstract:We consider multi-agent scheduling on a single machine, where the objective functions of the agents are of the max-form. For the feasibility model, we show that the problem can be solved in polynomial time even when the jobs are subject to precedence restrictions. For the minimality model, we show that the problem is strongly NP-hard in general, but can be solved in pseudo-polynomial time when the number of agents is a given constant. We then identify some special cases of the minimality model that can be solved in polynomial time.

show abstract

Section: Introduction and Problem Formulationsupporting

confidence: 68%

“…The following observation, which holds for two-agent scheduling (see Baker and Smith (2003), and Yuan et al (2005)), still holds for multi-agent scheduling.…”

Section: Polynomial-time Algorithms For Special Modelsmentioning

confidence: 86%

See 1 more Smart Citation

Multi-agent scheduling on a single machine with max-form criteria

Cheng

Yuan

2008

European Journal of Operational Research

150

View full text Add to dashboard Cite

show abstract

“…In addition, other -less employed-names have been suggested, such as 'competing users' (Shen, 1998;Agnetis et al, 2000), 'customers' (Baker and Smith, 2003), 'multiple job classes' (Soltani et al, 2010), 'multi-users' (Saule and Trystram, 2009), 'two families of jobs' (Yuan et al, 2005), 'mixed criteria scheduling problem' (Meiners and Torng, 2007), or even 'scheduling problem with a floating machine non-availability interval' (Kellerer and Strusevich, 2010), motivated by the fact that there is a machine maintenance interval which is not fixed. Finally, Arbib et al (2004) do not give a name for the problem.…”

Section: Fields Of Application and Problem Definitionmentioning

confidence: 99%

A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems

González

Framiñán

2014

European Journal of Operational Research

117

View full text Add to dashboard Cite

Most classical scheduling research assumes that the objectives sought are common to all jobs to be scheduled. However, many real-life applications can be modeled by considering different sets of jobs, each one with its own objective(s), and an increasing number of papers addressing these problems has appeared over the last few years. Since so far the area lacks a unified view, the studied problems have received different names (such as interfering jobs, multi-agent scheduling, mixed-criteria, etc), some authors do not seem to be aware of important contributions in related problems, and solution procedures are often developed without taking into account existing ones. Therefore, the topic is in need of a common framework that allows for a systematic recollection of existing contributions, as well as a clear definition of the main research avenues. In this paper we review multicriteria scheduling problems involving two or more sets of jobs and propose an unified framework providing a common definition, name and notation for these problems. Moreover, we systematically review and classify the existing contributions in terms of the complexity of the problems and the proposed solution procedures, discuss the main advances, and point out future research lines in the topic.

show abstract

“…Leung et al (2010) generalised the results for some two-agent problems and solved one open problem involving identical parallel machines. For more results on multi-agent scheduling, the reader may refer to Yuan et al (2005), Ng et al (2006), Wan et al (2010), Cheng et al (2011aCheng et al ( , 2011b, Liu et al (2010Liu et al ( , 2011, Mosheiov (2010, 2011), Nong et al (2011), Li and Hsu (2012), and Yin et al (2012), among others.…”

Section: Introductionmentioning

confidence: 99%

Two-agent single-machine scheduling with release times and deadlines

Yin

Cheng

et al. 2013

IJSTL

View full text Add to dashboard Cite

Multiple-agent scheduling has attracted considerable research attention in recent years. However, studies of multiple-agent scheduling with release times and deadlines are few. In the presence of ready times, sometimes it is beneficial to wait for future job arrivals in constructing a schedule. Inspired by the importance of ready times, we study the single-machine two-agent scheduling problem with releases times and deadlines to minimise the number of tardy jobs of one agent under the restriction that the maximum lateness of the jobs of the other agent cannot exceed a given value Q. Having established that the problem is strongly NP-hard, we provide a branch-and-bound and a simulated annealing algorithm to search for the optimal and approximate solutions, respectively. The results of computational experiments reveal that the SA algorithm can generate near-optimal solutions quickly.Keywords: scheduling; two agents; simulated annealing; release times.Reference to this paper should be made as follows: Yin, Y., Cheng, S-R., Cheng, T.C.E., Wu, W-H. and Wu, C-C. (2013) . His research covers semi-group theory, ring theory, module theory and their applications, and algebraic hyper-structure theory, fuzzy sets, rough sets and process scheduling. He has published more than 70 papers in these fields and written a book on fuzzy hemi-rings.

show abstract

A note on the scheduling with two families of jobs

Cited by 83 publications

References 1 publication

Multi-agent scheduling on a single machine with max-form criteria

Multi-agent scheduling on a single machine with max-form criteria

A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems

Two-agent single-machine scheduling with release times and deadlines

Contact Info

Product

Resources

About