Abstract
This work presents an Order Acceptance Scheduling (OAS) problem with the introduction of energy consumption limits at each period of the planning horizon. The objective is to maximize total profit of accepted orders while considering energy usage over time, in accordance with imposed deadlines. A time-indexed formulation is presented to tackle the investigated problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Błażewicz, J.: Scheduling under resource constraints: deterministic models. JC Baltzer (1986)
Brucker, P., Drexl, A., Mo, R., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 39 (1999)
Gafarov, E.R., Lazarev, A.A., Werner, F.: Single machine scheduling problems with financial resource constraints: some complexity results and properties. Math. Soc. Sci. 1, 7–13 (2011)
Gao, K., Huang, Y., Sadollah, A., Wang, L.: A review of energy-efficient scheduling in intelligent production systems. Complex Intell. Syst. 6(2), 237–249 (2019). https://doi.org/10.1007/s40747-019-00122-6
Garcia, C.: Resource-constrained scheduling with hard due windows and rejection penalties. Eng. Optim. 48(9), 1515–1528 (2016)
Györgyi, P., Kis, T.: Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints. J. Sched. 22(6), 623–634 (2019). https://doi.org/10.1007/s10951-019-00601-1
Györgyi, P., Kis, T.: New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints. arXiv:2004.00972 [math] (2020)
Kong, M., Pei, J., Liu, X., Lai, P.C., Pardalos, P.M.: Green manufacturing: order acceptance and scheduling subject to the budgets of energy consumption and machine launch. J. Cleaner Prod. 248, 119300 (2020)
Liao, X., Zhang, R., Chiong, R.: Multi-objective optimization of single machine scheduling with energy consumption constraints. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1–8. IEEE, Honolulu (2017)
Módos, I., Šůcha, P., Hanzálek, Z.: Algorithms for robust production scheduling with energy consumption limits. Comput. Ind. Eng. 112, 391–408 (2017)
O’Brien, M., Fischer, S., Schepelmann, P., Bringezu, S.: Resource efficiency in European industry. Study for the European Parliament, Brussels (2012)
Palakiti, V.P., Mohan, U., Ganesan, V.K.: Order acceptance and scheduling: overview and complexity results. Int. J. Oper. Res. 34(3), 369–386 (2019)
Tautenhahn, T., Woeginger, G.J.: Unit-time scheduling problems with time dependent resources. Computing 58(2), 97–111 (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bouzid, M., Masmoudi, O., Yalaoui, A. (2021). Single Machine Order Acceptance Scheduling with Periodic Energy Consumption Limits. In: Dolgui, A., Bernard, A., Lemoine, D., von Cieminski, G., Romero, D. (eds) Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems. APMS 2021. IFIP Advances in Information and Communication Technology, vol 630. Springer, Cham. https://doi.org/10.1007/978-3-030-85874-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-030-85874-2_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85873-5
Online ISBN: 978-3-030-85874-2
eBook Packages: Computer ScienceComputer Science (R0)
