Open Access
| Issue |
RAIRO-Oper. Res.
Volume 55, Number 6, November-December 2021
|
|
|---|---|---|
| Page(s) | 3701 - 3714 | |
| DOI | https://doi.org/10.1051/ro/2021175 | |
| Published online | 14 December 2021 | |
- A. Agnetis, P.B. Mirchani, D. Pacciarelli and A. Pacifici, Scheduling problems with two competing agents. Oper. Res. 52 (2004) 229–242. [CrossRef] [MathSciNet] [Google Scholar]
- A. Agnetis, J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli and A. Soukhal, Multiagent Scheduling: Models and Algorithms. Springer-Verlag (2014). [Google Scholar]
- S. Albers and P. Brucker, The complexity of one-machine batching problems. Discrete Appl. Math. 47 (1993) 87–107. [CrossRef] [MathSciNet] [Google Scholar]
- A. Allahverdi, The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246 (2015) 345–378. [CrossRef] [Google Scholar]
- K.R. Baker and J.C. Smith, A multiple-criterion model for machine scheduling. J. Scheduling 6 (2003) 7–16. [CrossRef] [MathSciNet] [Google Scholar]
- E.G. Coffman, M. Yannakakis, M.J. Magazine and C. Santos, Batch sizing and job sequencing on a single machine. Ann. Oper. Res. 26 (1990) 135–147. [CrossRef] [MathSciNet] [Google Scholar]
- Q. Feng, Z.Y. Yu and W.P. Shang, Pareto optimization of serial-batching scheduling problems on two agents. In: The 2011 International Conference on Advanced Mechatronic Systems. IEEE (2011). [Google Scholar]
- Z.C. Geng, J.J. Yuan and J.L. Yuan, Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost. Appl. Math. Comput. 332 (2018) 1–18. [Google Scholar]
- C. He and H. Lin, Improved algorithms for two-agent scheduling on an unbounded serial-batching machine. Discrete Optim. 41 (2021) 100655. [CrossRef] [Google Scholar]
- C. He, Y.X. Lin and J.J. Yuan, Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine. Found. Comput. Decis. Sci. 33 (2008) 369–376. [Google Scholar]
- C. He, Y.X. Lin and J.J. Yuan, A DP algorighm for minimizing makespan and total completion time on a series-batching machine. Inf. Process. Lett. 109 (2009) 603–607. [Google Scholar]
- C. He, C.Q. Xu and H. Lin, Serial-batching scheduling with two agents to minimize makespan and maximum cost. J. Scheduling 23 (2020) 609–617. [CrossRef] [MathSciNet] [Google Scholar]
- H. Hoogeveen, Multicriteria scheduling. Eur. J. Oper. Res. 167 (2005) 592–623. [CrossRef] [Google Scholar]
- M.Y. Kovalyov, A. Oulamara and A. Soukhal, Two-agent scheduling with agent specific batches on an unbounded serial batching machine. J. Scheduling 18 (2015) 423–434. [CrossRef] [MathSciNet] [Google Scholar]
- S.S. Li, R.X. Chen and Q. Feng, Scheduling two job families on a single machine with two competitive agents. J. Comb. Optim. 32 (2016) 784–799. [CrossRef] [MathSciNet] [Google Scholar]
- S.S. Li, T.C.E. Cheng, C.T. Ng and J.J. Yuan, Two-agent scheduling on a single sequential and compatible batching machine. Nav. Res. Logistics 64 (2017) 628–641. [CrossRef] [Google Scholar]
- C.L. Monma and C.N. Potts, On the complexity of scheduling with batch setup times. Oper. Res. 37 (1989) 798–804. [CrossRef] [MathSciNet] [Google Scholar]
- P. Perez-Gonzalez and J.M. Framinan, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems. Eur. J. Oper. Res. 235 (2014) 1–16. [CrossRef] [Google Scholar]
- C.N. Potts and M.Y. Kovalyov, Scheduling with batching: a review. Eur. J. Oper. Res. 120 (2000) 228–249. [CrossRef] [Google Scholar]
- S. Webster and K.R. Baker, Scheduling groups of jobs on a single machine. Oper. Res. 43 (1995) 692–703. [CrossRef] [MathSciNet] [Google Scholar]
- Y.Q. Yin, Y. Wang, T.C.E. Cheng and D.J. Wang and C.-C. Wu, Two-agent single-machine scheduling to minimize the batch delivery cost. Comput. Ind. Eng. 92 (2016) 16–30. [CrossRef] [Google Scholar]
- Y.Q. Yin, Y.J. Yang, D.J. Wang, T.C.E. Cheng and C.-C. Wu, Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Nav. Res. Logistics 65 (2018) 393–409. [CrossRef] [Google Scholar]
- Y.Q. Yin, D.D. Li, D.J. Wang and T.C.E. Cheng, Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Ann. Oper. Res. 298 (2021) 497–523. [CrossRef] [MathSciNet] [Google Scholar]
- J.J. Yuan, C.T. Ng and T.C.E. Cheng, Scheduling with release dates and preemption to minimize multiple max-form objective functions. Eur. J. Oper. Res. 280 (2020) 860–875. [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.