Title: Integrating two-agent scheduling and order acceptance problems to maximise total revenue by bounding each agent penalty function

Authors: Mohammad Reisi-Nafchi; Ghasem Moslehi

Addresses: Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan 84156-83111, Iran ' Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan 84156-83111, Iran

Abstract: This paper integrates the two-agent scheduling problem and the order acceptance and scheduling problem, to form a single problem for further investigation. The idea originates from real life situations in which manufacturers deal with different customers, each having different requests. It is, therefore, assumed in the new problem that two customer (agent) types exist while each has their specific penalty functions. The penalty function of the first agent is the total lateness while that of the second is the number of tardy orders. The objective is maximising the total revenue of accepted orders by bounding each agent's penalty function. For this problem, a pseudo-polynomial dynamic programming algorithm is developed. It was shown that the algorithm is capable of optimally solving all the problem instances up to 50 orders in size. The algorithm is found to be capable of solving 87.15% of the instances with 90 orders.

Keywords: operations management; order acceptance; two-agent scheduling; dynamic programming; analysis of variance; ANOVA; total revenue; agent penalty function.

DOI: 10.1504/IJSOM.2015.067773

International Journal of Services and Operations Management, 2015 Vol.20 No.3, pp.358 - 384

Published online: 18 Apr 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article