Abstract
In classical scheduling problem, it is assumed that all orders must be processed. In the order acceptance and scheduling (OAS) problem, some orders are rejected due to limited capacity. In make-to-order production environment, in which the OAS problem occurs, accepting all orders may cause overloads, delay in deliveries and unsatisfied customers. Oğuz et al. (2010) introduced the OAS problem with sequence-dependent setup times and release dates. In this paper, we propose a new mixed integer programming formulation with O(n2) decision variables and O(n2) constraints for the same problem. We conduct a computational analysis comparing the performance of our formulation with Oğuz et al. (2010) formulation. We use the benchmark instances, which are available in the literature. We observe that our formulation can solve all the instances up to 50 orders in a reasonable time, while Oğuz et al. (2010) formulation can solve only the instances with 10 orders in the same time limit.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Slotnick, S.A.: Order acceptance and scheduling: a taxonomy and review. Eur. J. Oper. Res. 212, 1–11 (2011)
Oğuz, C., Salman, F.S., Bilgintürk Yalçın, Z.: Order acceptance and scheduling decisions in make-to-order systems. Int. J. Prod. Econ. 125, 200–211 (2010)
Silva, Y.L.T., Subramanian, A., Pessoa, A.A.: Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times. Comput. Oper. Res. 90, 142–160 (2018)
Stern, H.I., Avivi, Z.: The selection and scheduling of textile orders. Eur. J. Oper. Res. 44, 11–16 (1990)
Charnsirisakskul, K., Griffin, P.M., Keskinocak, P.: Order selection and scheduling with leadtime flexibility. IIE Trans. 36, 697–707 (2004)
Charnsirisakskul, K., Griffin, P.M., Keskinocak, P.: Pricing and scheduling decisions with leadtime flexibility. Eur. J. Oper. Res. 171, 153–169 (2006)
Nobibon, F.T., Leus, R.: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment. Comput. Oper. Res. 38(1), 367–378 (2011)
Garcia, C.: Resource-constrained scheduling with hard due windows and rejectionpenalties. Eng. Optim. 48, 1515–1528 (2016)
Trigos, F., López, E.M.: Maximising profit for multiple-product, single-period, single-machine manufacturing under sequential set-up constraints that depend on lot size. Int. J. Prod. Res. 54, 1134–1151 (2016)
Zandieh, M., Roumani, M.: A biogeography-based optimization algorithm for order acceptance and scheduling. J. Ind. Prod. Eng. 34, 312–321 (2017)
Cesaret, B., Oğuz, C., Salman, F.S.: A tabu search algorithm for order acceptance and scheduling. Comput. Oper. Res. 39, 1197–1205 (2012)
Della Croce, F.: MP or not MP: That is the question. J. Sched. 19(1), 33–42 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Bıçakcı, P.S., Kara, İ. (2020). Order Acceptance and Scheduling Problem: A Proposed Formulation and the Comparison with the Literature. In: Karwowski, W., Trzcielinski, S., Mrugalska, B. (eds) Advances in Manufacturing, Production Management and Process Control. AHFE 2019. Advances in Intelligent Systems and Computing, vol 971. Springer, Cham. https://doi.org/10.1007/978-3-030-20494-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-20494-5_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20493-8
Online ISBN: 978-3-030-20494-5
eBook Packages: EngineeringEngineering (R0)