 Two-agent order acceptance and scheduling to maximise total revenueMohammad Reisi-Nafchi and Ghasem Moslehi European Journal of Industrial Engineering, 2015, vol. 9, issue 5, 664-691 Abstract: The order acceptance and scheduling problem has attracted the attention of many researchers over the past two decades. Studies dealing with profit calculation in this problem have so far focused only on one type of penalty function. This is while in real life situations each manufacturer can have different customers and may deal with each individual customer through different objective functions. In this paper, the order acceptance and scheduling problem has been redefined as a two-agent case for which a new and more practical problem has been considered. The objective is maximising the total revenue from accepted orders by considering an upper bound on the total lateness of the first agent's orders and no tardy orders of the second. A mathematical programming model and a pseudo-polynomial dynamic programming are proposed to optimally solve the problem. Computational results for this problem have shown the capability of the proposed approach. [Received 12 April 2013; Revised 12 January 2014; Revised 3 June 2014; Accepted 18 August 2014] Keywords: order acceptance; two-agent scheduling; dynamic programming; mathematical programming; total revenue. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:9:y:2015:i:5:p:664-691 Access Statistics for this article More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.