Advanced search
Publication Cover
Journal of the Operational Research Society Volume 75, 2024 - Issue 7
Submit an article Journal homepage
120
Views
3
CrossRef citations to date
0
Altmetric
Research Articles

Single machine scheduling with resource constraints: Equivalence to two-machine flow-shop scheduling for regular objectives

Sergey Kovaleva INSEEC - Omnes Education, Lyon, FranceCorrespondence[email protected]
,
Isabelle Chalamona INSEEC - Omnes Education, Lyon, France
&
Audrey Bécuweb CREOP UR 15561 - Limoges University, Limoges, France
Pages 1343-1346 | Received 24 Feb 2023, Accepted 27 Jul 2023, Published online: 10 Aug 2023

References

  • Brucker, P., & Knust, S. (2023). http://www2.informatik.uni-osnabrueck.de/knust/class/dateien/classes/f_nop/f_nop.pdf
  • Bruno, J., Jones III, J.W., So, K. (1980). Deterministic scheduling with pipelined processors.IEEE Transactions on Computers, C-29(4), 308–316. https://doi.org/10.1109/TC.1980.1675569
  • Gafarov, E. R., Lazarev, A. A., & Werner, F. (2011). Single machine scheduling problems with financial resource constraints: Some complexity results and properties. Mathematical Social Sciences, 62(1), 7–13. https://doi.org/10.1016/j.mathsocsci.2011.04.004
  • Gafarov, E. R., Lazarev, A. A., & Werner, F. (2013). A note on the paper “Single machine scheduling problems with financial resource constraints: Some complexity results and properties” by E.R. Gafarov. Mathematical Social Sciences, 65(3), 232. https://doi.org/10.1016/j.mathsocsci.2012.11.004
  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Co.
  • Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129. https://doi.org/10.1287/moor.1.2.117
  • Gartner, D., Viana, J., Tabar, B. R., Pförringer, D., & Edenharter, G. (2022). Challenging the throwaway culture in hospitals: Scheduling the mix of reusable and single-use bronchoscopes. Journal of the Operational Research Society, 1–12. https://doi.org/10.1080/01605682.2022.2129490
  • Grieco, L., Utley, M., & Crowe, S. (2021). Operational research applied to decisions in home health care: A systematic literature review. Journal of the Operational Research Society, 72(9), 1960–1991. https://doi.org/10.1080/01605682.2020.1750311
  • Jiang, Y., Zhang, Z., Song, X., & Yin, Y. (2022). Scheduling controllable processing time jobs in seru production system with resource allocation. Journal of the Operational Research Society, 73(11), 2551–2571. https://doi.org/10.1080/01605682.2021.1999182
  • Johnson, S. M. (1954). Optimal two and three stage production schedules with setup time included. Naval Research Logistics Quarterly, 1(1), 61–68. https://doi.org/10.1002/nav.3800010110
  • Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362.
  • Liu, L., Wang, C., Wang, J.-J., & Crespo, A. M. F. (2023). An iterative auction for resource-constrained surgical scheduling. Journal of the Operational Research Society, 74(3), 968–978. https://doi.org/10.1080/01605682.2022.2083988
  • Mostafa, B., Molnar, M., Saleh, M., Benslimane, A., & Kassem, S. (2022). Optimal proactive monitor placement & scheduling for IoT networks (2021). Journal of the Operational Research Society, 73(11), 2431–2450. https://doi.org/10.1080/01605682.2021.1992310
  • Nansheng, P., & Qichen, M. (2023). Resource allocation in robust scheduling. (2023). Journal of the Operational Research Society, 74(1), 125–142. https://doi.org/10.1080/01605682.2022.2029593
  • Shi, Y., Su, H., & Pang, N. (2021). Resource flow network generation algorithm in robust project scheduling. Journal of the Operational Research Society, 72(6), 1294–1308. https://doi.org/10.1080/01605682.2020.1718558
  • Toker, A., Kondakci, S., & Erkip, N. (1991). Scheduling under a non-renewable resource constraint. Journal of the Operational Research Society, 42(9), 811–814. https://doi.org/10.1057/jors.1991.152

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.