Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents

B Mor and G Mosheiov
Additional contact information
B Mor: The Department of Economics and Business Administration, Ariel University Center of Samaria, Israel
G Mosheiov: The Hebrew University, Jerusalem, Israel

Journal of the Operational Research Society, 2014, vol. 65, issue 1, 151-157

Abstract: In scheduling problems with two competing agents, each one of the agents has his own set of jobs and his own objective function, but both share the same processor. The goal is to minimize the value of the objective function of one agent, subject to an upper bound on the value of the objective function of the second agent. In this paper we study two-agent scheduling problems on a proportionate flowshop. Three objective functions of the first agent are considered: minimum maximum cost of all the jobs, minimum total completion time, and minimum number of tardy jobs. For the second agent, an upper bound on the maximum allowable cost is assumed. We introduce efficient polynomial time solution algorithms for all cases.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v65/n1/pdf/jors20139a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v65/n1/full/jors20139a.html Link to full text HTML (text/html)
Access to full text is restricted to subscribers.

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:pal:jorsoc:v:65:y:2014:i:1:p:151-157

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().