Title: Service level and profit maximisation in order acceptance and scheduling problem with weighted tardiness

Authors: Mohammad Yavari; Amir Hosein Akbari

Addresses: Department of Industrial Engineering, University of Qom, Qom, Iran ' Department of Industrial Engineering, University of Tehran, Tehran, Iran

Abstract: Traditional order acceptance and scheduling (OAS) problem focused on profit optimisation and the number of accepted orders has been only regarded as a constraint in the OAS model in a few research studies. The current paper investigates a bi-objective OAS problem to maximise profit and service level. There are two categories of regular and special orders in a single-machine environment. We have proposed a mixed integer linear program using goal programming. Due to the NP-hard nature of the problem, we have developed a simulated annealing-based heuristic to solve the problem, and a lower bound to assess its performance. Both single objective and bi-objective versions of the problem have been studied. Computational experiments demonstrate the ability of the proposed heuristic. The advantages and disadvantages of the proposed bi-objective OAS problem are discussed. Also, the relation between service level and profit objectives is studied in both problems with and without special orders.

Keywords: order acceptance and scheduling; OAS; service level; simulated annealing-based heuristic; mixed-integer linear programming; MILP; goal programming; bi-objective; lower bound.

DOI: 10.1504/IJISE.2023.129138

International Journal of Industrial and Systems Engineering, 2023 Vol.43 No.3, pp.331 - 362

Received: 08 Nov 2019
Accepted: 01 Mar 2021
Published online: 22 Feb 2023 *

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