EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 59 / No 1 (January-February 2025) RAIRO-Oper. Res., 59 1 (2025) 483-498 References
Open Access
Issue
RAIRO-Oper. Res.
Volume 59, Number 1, January-February 2025
Page(s) 483 - 498
DOI https://doi.org/10.1051/ro/2024228
Published online 06 February 2025
  • G.I. Adamopoulos and C.P. Pappis, Single machine scheduling with flow allowances. J. Oper. Res. Soc. 47 (1996) 1280–1285. [Google Scholar]
  • S. Gawiejnowicz, Models and Algorithms of Time-Dependent Scheduling. Springer (2020). [Google Scholar]
  • X.-N. Geng, J.-B. Wang and D. Bai, Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Eng. Optim. 51 (2019) 1301–1323. [CrossRef] [MathSciNet] [Google Scholar]
  • G.H. Hardy, J.E. Littlewood and G. Pólya, Inequalities. Cambridge University Press (1967). [Google Scholar]
  • L. Li and J.-J. Wang, Scheduling jobs with deterioration effect and controllable processing time. Neural Comput. App. 29 (2018) 1163–1170. [CrossRef] [Google Scholar]
  • M.-H. Li, D.-Y. Lv, Y.-Y. Lu and J.-B. Wang, Scheduling with group technology, resource allocation, and learning effect simultaneously. Mathematics 12 (2024) 1029. [CrossRef] [Google Scholar]
  • W. Liu and C. Jiang, Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng. Optim. 52 (2020) 74–89. [CrossRef] [MathSciNet] [Google Scholar]
  • Y.-Y. Lu and J.-Y. Liu, A note on resource allocation scheduling with position-dependent workloads. Eng. Optim. 50 (2018) 1810–1827. [CrossRef] [MathSciNet] [Google Scholar]
  • Y.-Y. Lu, T.-T. Wang, R.-Q. Wang and Y. Li, A note on due-date assignment scheduling with job-dependent learning effects and convex resource allocation. Eng. Optim. 53 (2021) 1273–1281. [CrossRef] [MathSciNet] [Google Scholar]
  • D.-Y. Lv, S.-W. Luo, J. Xue, J.-X. Xu and J.-B. Wang, A note on single machine common flow allowance group scheduling with learning effect and resource allocation. Comput. Ind. Eng. 151 (2021) 106941. [CrossRef] [Google Scholar]
  • B. Mor, Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation. Eng. Optim. 51 (2019) 1251–1267. [CrossRef] [MathSciNet] [Google Scholar]
  • B. Mor, A unified approach for single machine scheduling with position-dependent workloads and positional penalties. SN Appl. Sci. 2 (2020) 214. [CrossRef] [Google Scholar]
  • B. Mor, Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads. J. Comb. Optim. 43 (2022) 79–97. [CrossRef] [MathSciNet] [Google Scholar]
  • B. Mor and G. Mosheiov, Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. Eur. J. Oper. Res. 254 (2016) 360–370. [CrossRef] [Google Scholar]
  • B. Mor, D. Shabtay and L. Yedidsion, Heuristic algorithms for solving a set of np-hard single-machine scheduling problems with resource-dependent processing times. Comput. Ind. Eng. 153 (2021) 107024. [Google Scholar]
  • G. Mosheiov, D. Oron and A. Salehipour, Coupled task scheduling with convex resource consumption functions. Discrete Appl. Math. 293 (2021) 128–133. [CrossRef] [MathSciNet] [Google Scholar]
  • D. Oron, Scheduling controllable processing time jobs with position-dependent workloads. Int. J. Prod. Econ. 173 (2016) 153–160. [CrossRef] [Google Scholar]
  • S.S. Panwalkar, M.L. Smith and A. Seidmann, Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper. Res. 30 (1982) 391–399. [CrossRef] [Google Scholar]
  • J. Ren and Y. Yang, Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine. Eng. Optim. 54 (2022) 1819–1834. [CrossRef] [MathSciNet] [Google Scholar]
  • D. Shabtay and G. Steiner, A survey of scheduling with controllable processing times. Discrete Appl. Math. 155 (2007) 1643–1666. [Google Scholar]
  • D. Shabtay and M. Zofi, Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan. Int. J. Prod. Econ. 198 (2018) 191–200. [CrossRef] [Google Scholar]
  • X. Sun, X.-N. Geng, J.-B. Wang and F. Liu, Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect. Int. J. Prod. Res. 57 (2019) 1873–1891. [CrossRef] [Google Scholar]
  • L. Sun, A.J. Yu and B. Wu, Single machine common flow allowance group scheduling with learning effect and resource allocation. Comput. Ind. Eng. 139 (2020) 106126. [CrossRef] [Google Scholar]
  • X. Wang and W. Liu, Optimal different due-date assignment scheduling with group technology and resource allocation. Mathematics 12 (2024) 436. [CrossRef] [MathSciNet] [Google Scholar]
  • W. Wang, J.-J. Wang and J.-B. Wang, Solution algorithms for single-machine group scheduling with learning effect and convex resource allocation. Complexity 2021 (2021) 6615824. [CrossRef] [Google Scholar]
  • J.-B. Wang, J. Xue, B. Cui and M. Gao, Single-machine scheduling problems with variable processing times and past-sequence-dependent delivery times. Asia-Pac. J. Oper. Res. 39 (2022) 2150013. [CrossRef] [Google Scholar]
  • Y.-C. Wang, S.-H. Wang and J.-B. Wang, Resource allocation scheduling with position-dependent weights and generalized earliness–tardiness cost. Mathematics 11 (2023) 222. [CrossRef] [MathSciNet] [Google Scholar]
  • Z.-J. Wei, L.-Y. Wang, L. Zhang, J.-B. Wang and E. Wang, Single-machine maintenance activity scheduling with convex resource constraints and learning effects. Mathematics 11 (2023) 3536. [CrossRef] [Google Scholar]
  • L.-H. Zhang, D.-Y. Lv and J.-B. Wang, Two-agent slack due-date assignment scheduling with resource allocations and deteriorating jobs. Mathematics 11 (2023) 2737. [CrossRef] [Google Scholar]
  • Y. Zhang, X. Sun, T. Liu, J. Wang and X.-N. Geng, Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects. J. Oper. Res. Soc. (2024) 1–13. DOI: 10.1080/01605682.2024.2371527. [Google Scholar]
  • X. Zhao, J. Xu, J.-B. Wang and L. Li, Bicriteria common flow allowance scheduling with aging effect, convex resource allocation, and a rate-modifying activity on a single machine. Asia-Pac. J. Oper. Res. 39 (2022) 2150046. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.