A satisfactory multi-agent single-machine considering a cross-docking terminal
by Mohammadbagher Afshar-Bakeshloo; Fariborz Jolai; Mostafa Mazinani; Reza Tavakkoli-Moghaddam
International Journal of System of Systems Engineering (IJSSE), Vol. 9, No. 4, 2019

Abstract: This study addresses a two-agent single-machine scheduling problem; whose objectives are to maximise the agents' service levels regarding their desired time windows. This is a new variant of multi-agent scheduling problems that agents' time windows are taken into account. Proposing a dashboard to determine optimal sequences of the jobs is essential since all the jobs are characterised by unequal release dates, due dates, and deadlines. Employing this dashboard, the decision maker tries to provide a schedule based on a specific level of services for each agent. A cross-dock terminal with multiinbound door and one-outbound door is an excellent example of the proposed model. Here, the dispatcher schedules the jobs so that each agent gets a predetermined level of satisfaction. This problem is formulated with a mixedinteger linear programming model considering a piecewise linear function. The results show that the multi-objective imperialist competitive algorithm (MOICA) performs better than NSGA-II and MOIWO.

Online publication date: Fri, 20-Dec-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of System of Systems Engineering (IJSSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com