An efficient heuristic for a real-life OAS problem

Marcin Anholcer () and Andrzej Żak ()

Operations Research and Decisions, 2025, vol. 35, issue 1, 1-20

Abstract: Inspired by a real-life manufacturing problem, we present a mathematical model and a heuristic that solves it. A desired solution needs not only to maximize the company’s profit but must also be easy to interpret by the members of the management. The considered problem is thus a variant of the order acceptance and scheduling (OAS) problem, which can be solved using known heuristics. Our approach is different because we study the mechanism by which setup times arise, unlike other approaches where setup times are treated as parts of the instance. This enables us to develop a very fast and efficient heuristic, formulate a MILP model that can be applied to solve much larger problems than previously known methods, and ultimately meet decision-makers’ expectations. We prove the efficiency of the presented method by comparing its results with the optimum obtained by a state-of-the-art solver. We also briefly discuss a case study that arose in a food industry company in Poland.

Keywords: order acceptance and scheduling; sequence-dependence; greedy heuristics (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/ord2025vol35no1_1.pdf (application/pdf)

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:wut:journl:v:35:y:2025:i:1:p:1-20:id:1

DOI: 10.37190/ord250101

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().