Multi-agent single machine scheduling problem with transportation constraints

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ziaee Mohsen; Imanparast Mahdi; Khodabakhshi Vahid

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Mathematical Modeling Year:2022 | Volume:10 | Issue:3 Page(s): 367-385

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Multi-agent single machine scheduling problem with transportation constraints

Author(s)

Ziaee Mohsen | Imanparast Mahdi | Khodabakhshi Vahid | Issue Writer Certificate

Keywords

Single machine scheduling problem

transportation constraints

mixed integer linear programming

heuristic algorithm

Abstract

A multi-agent Single machine scheduling problem with transportation constraints is studied. We assume that there are several independent agents placed in different geographical locations, each of them has several orders and each order includes different types of products. We use a simple and effective model to obtain maximum profit of the products. To have desired on-time deliveries, the minimization of the transportation costs and total tardiness costs are considered as objective functions. The main idea of this research is to develop a simple and integrated scheduling and transportation model which can be applied in many factories, chain stores, and so on. In order to solve this problem, a mixed integer linear programming (MILP) model is presented. Moreover, since solving large instances of the proposed MILP model is very time-consuming, a heuristic algorithm is presented. Implementing of two approaches on a variety of datasets show that the heuristic algorithm can provide good-quality solutions in very short time.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans