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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.