Open Access
| Issue |
RAIRO-Oper. Res.
Volume 59, Number 5, September-October 2025
|
|
|---|---|---|
| Page(s) | 3253 - 3265 | |
| DOI | https://doi.org/10.1051/ro/2025126 | |
| Published online | 31 October 2025 | |
- A. Agnetis, J.C. Billiaut, S. Gawiejnowicz, D. Pacciarellia and A. Soukhal, Multi-agent Scheudling: Models and Algorithms. Springer-Verlag, Berlin, Heidelberg, Germany (2014). [Google Scholar]
- A. Agnetis, P.B. Mirchandani, D. Pacciarelli and A. Pacifici, Scheudling problems with two competing agents. Oper. Res. 52 (2004) 229–242. [CrossRef] [MathSciNet] [Google Scholar]
- A. Bachman and A. Janiak, Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 55 (2004) 257–264. [Google Scholar]
- K.R. Baker and J.C. Smith, A multi-criterion model for machine scheduling. J. Sched. 6 (2003) 7–16. [CrossRef] [MathSciNet] [Google Scholar]
- S. Browne and U. Yechiali, Scheduling deteriorating jobs on a single processor. Oper. Res. 38 (1990) 494–498. [Google Scholar]
- R.B. Chen, J.J. Yuan and Y. Gao, The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. J. Sched. 22 (2019) 581–593. [Google Scholar]
- M.B. Cheng, P.R. Tadikamall, J. Shang and S.Q. Zhang, Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs. Eur. J. Oper. Res. 234 (2014) 650–657. [Google Scholar]
- M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979). [Google Scholar]
- S. Gawiejnowicz, Models and Algorithms of Time-Dependent Scheduling. Springer (2020). [Google Scholar]
- S. Gawiejnowicz and C. Suwalski, Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria. Comput. Oper. Res. 52 (2014) 135–146. [Google Scholar]
- G.N.D. Gupta and S.K. Gupta, Single facility scheduling with nonlinear processing times. Comput. Ind. Eng. 14 (1988) 387–393. [CrossRef] [Google Scholar]
- S.M. Johnson, Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logistics 1 (1954) 61–68. [Google Scholar]
- A. Kononov and S. Gawiejnowicz, NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Oper. Res. Soc. 52 (2001) 708–717. [Google Scholar]
- R. Ma, J.P. Tao and J.J. Yuan, Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. Appl. Math. Comput. 273 (2016) 570–583. [Google Scholar]
- C.X. Miao, Complexity of scheduling with proportional deterioration and release dates. Iran. J. Sci. Technol. Trans. A-Sci. 42 (2018) 1337–1342. [Google Scholar]
- C.X. Miao, Y.Z. Zhang and Z.G. Cao, Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs. Inf. Process. Lett. 111 (2011) 798–803. [Google Scholar]
- G. Mosheiov, Scheduling jobs under simple linear deterioration. Comput. Oper. Res. 21 (1994) 653–659. [Google Scholar]
- P. Perez-Gonzalez and J.M. Framinan, A common framework and taxonomy for multicriterla scheduling problems with interfering and competing jobs: multi-agent scheduling problems. Eur. J. Oper. Res. 235 (2014) 1–16. [CrossRef] [Google Scholar]
- J.B. Wang, D.Y. Lv, S.Y. Wang and J. Chong, Resource allocation scheduling with deteriorating jobs and position-dependent workloads. J. Ind. Manage. Optim. 19 (2023) 1658–1669. [Google Scholar]
- H.J. Wei and J.J. Yuan, Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time. Oper. Res. Lett. 41 (2019) 41–46. [Google Scholar]
- L.Y. Yang and X.W. Lu, Two-agent scheduling problems with the general position-dependent processing time. Theor. Comput. Sci. 796 (2019) 90–98. [Google Scholar]
- S.H. Yang and J.B. Wang, Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration. Appl. Math. Model. 217 (2011) 4819–4826. [Google Scholar]
- L.H. Zhang, X.N. Geng, J. Xue and J.B. Wang, Single machine slack due window assignment and deteriorating jobs. J. Ind. Manage. Optim. 20 (2024) 1593–1614. [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.