A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines

Zhao, Kejun; Lu, Xiwen; Gu, Manzhan

doi:10.1007/s10951-015-0460-y

Cited by 20 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, research has focused on how to allocate a job sequence using only algorithms. For example, Zhao et al 9 considered PjjC A max : C B max Q and proposed an approximation algorithm to solve this problem effectively. Zhao and Lu 10 proposed (b, b)-approximation algorithms for P m jj P W j C j , C max .…”

Section: Literature Reviewmentioning

confidence: 99%

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Wen

2018

Advances in Mechanical Engineering

View full text Add to dashboard Cite

We study an agent-based scheduling problem of two identical parallel machines:. The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed to achieve the optimum from the two task agents, agent A and agent B. The objective is divided into two classes. The objectives of agent A and agent B are to minimize the total tardiness time and minimize the makespan, respectively. In this article, we research two identical parallel machines in which one job category can be processed by one machine agent only or two machine agents and propose a new multi-agent model for two identical parallel machines, divided into two subsystems. For subsystem 1, the shortest processing time order is used to solve job priorities. A single distribution strategy is proposed to assign jobs to machine agents and is applied to the dynamic scheduling environment. For subsystem 2, a centralized distribution strategy is applied to the static scheduling environment. The proposed model performs more efficiently and is better able to handle complex and dynamic scheduling environments.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Wen

2018

Advances in Mechanical Engineering

View full text Add to dashboard Cite

show abstract

“…Some researches focus on how to allocate job sequence by the algorithms only. For example, Zhao et al 9 research PjjC A max : C B max Q and propose an approximation algorithm to solve this problem effectively. Zhao and Lu 10 propose (b, b)-approximation algorithms for P m jj P W j C j , C max .…”

Section: Literature Reviewmentioning

confidence: 99%

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Yu¹,

Wen²,

Sangbong³

2017

Advances in Mechanical Engineering

View full text Add to dashboard Cite

We study a base-agent scheduling problem of two identical parallel machines: P2jCoj P T A , C B max . The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed in order to achieve the optimum of task agents, which contains two agents: agent A and agent B. The objective is divided into two classes. The objective of agent A and agent B is to minimize total tardiness time and minimize makespan, respectively. In this article, we research character of two identical parallel machines that one category job can be processed by one machine agent only or two machine agents and propose a new multi-agent model on two identical parallel machines, divided into two subsystems. For subsystem 1, it is applied by a dynamic scheduling environment. Shortest processed time order is proposed to solve jobs' priorities. Single distribution strategy is proposed to solve assignment of jobs to machine agents. For subsystem 2, centralized distribution strategy applied to a static scheduling environment is addressed. The new model performs more efficiently and owns a stronger ability to deal with complex and dynamic scheduling environments.

show abstract

“…Classic allocation models usually take these jobs and machines into consideration, where operating times are assumed to be the same for each machine, simplifying a realworld scenario [2]. The literature addressing machine scheduling is vast; several surveys and reviews on the topic can be found in [3][4][5][6][7][8][9][10].…”

Section: Introductionmentioning

confidence: 99%

“…Specific to the literature scheduling agents/servers in machines, reference [2] presented an algorithm to schedule multi-agent on two identical parallel machines, where the makespan is minimized. A scheduling model with three agents in just one machine is also proposed by [30], who seek to minimize the number of jobs assigned to the first agent.…”

Section: Introductionmentioning

confidence: 99%

Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem

2021

View full text Add to dashboard Cite

Assignation-sequencing models have played a critical role in the competitiveness of manufacturing companies since the mid-1950s. The historic and constant evolution of these models, from simple assignations to complex constrained formulations, shows the need for, and increased interest in, more robust models. Thus, this paper presents a model to schedule agents in unrelated parallel machines that includes sequence and agent–machine-dependent setup times (ASUPM), considers an agent-to-machine relationship, and seeks to minimize the maximum makespan criteria. By depicting a more realistic scenario and to address this NP-hard problem, six mixed-integer linear formulations are proposed, and due to its ease of diversification and construct solutions, two multi-start heuristics, composed of seven algorithms, are divided into two categories: Construction of initial solution (designed algorithm) and improvement by intra (tabu search) and inter perturbation (insertions and interchanges). Three different solvers are used and compared, and heuristics algorithms are tested using randomly generated instances. It was found that models that linearizing the objective function by both job completion time and machine time is faster and related to the heuristics, and presents an outstanding level of performance in a small number of instances, since it can find the optimal value for almost every instance, has very good behavior in a medium level of instances, and decent performance in a large number of instances, where the relative deviations tend to increase concerning the small and medium instances. Additionally, two real-world applications of the problem are presented: scheduling in the automotive industry and healthcare.

show abstract

A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines

Cited by 20 publications

References 12 publications

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem

Contact Info

Product

Resources

About