Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System

S. Polyakovskiy () and R. M’ Hallah ()
Additional contact information
S. Polyakovskiy: FZI Forschungszentrum Informatik
R. M’ Hallah: Kuwait University

A chapter in Operations Research Proceedings 2012, 2014, pp 417-422 from Springer

Abstract: Abstract The weighted earliness tardiness parallel machine scheduling problem is NP hard. It is herein approximately solved using a decentralized multi-agent system (MAS). MAS acts as a moderator of two types of agents: free jobs, and groups of jobs assigned to machines. MAS yields good solutions’ quality in reduced run times as evidenced by the computational results. Most importantly, it can be easily adapted to similar problems.

Keywords: Tardiness; Free Job; Parallel Machine Scheduling Problem; Traditional Optimization Procedures; Processing Interval (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-00795-3_62

Ordering information: This item can be ordered from
http://www.springer.com/9783319007953

DOI: 10.1007/978-3-319-00795-3_62

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().