EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 55 / No 2 (March-April 2021) RAIRO-Oper. Res., 55 2 (2021) 561-569 References
Free Access
Issue
RAIRO-Oper. Res.
Volume 55, Number 2, March-April 2021
Page(s) 561 - 569
DOI https://doi.org/10.1051/ro/2021030
Published online 09 April 2021
  • G.I. Adamopoulos and C.P. Pappis, Single machine scheduling with flow allowances. J. Oper. Res. Soc. 47 (1996) 1280–1285. [Google Scholar]
  • A. Agnetis, J.-C. Billaut, S. Gawiejnowicz, D. Pacciarelli and A. Soukhal, Multiagent Scheduling: Models and Algorithms. Springer-Verlag, Berlin (2014). [Google Scholar]
  • A. Azzouz, M. Ennigrou and L.B. Said, Scheduling problems under learning effects: classification and cartography. Int. J. Prod. Res. 56 (2018) 1642–1661. [Google Scholar]
  • U.B. Bagchi, Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems. Oper. Res. 37 (1989) 118–125. [Google Scholar]
  • T.C.E. Cheng, C. Oğaz and X.D. Qi, Due-date assignment and single machine scheduling with compressible processing times. Int. J. Prod. Econ. 43 (1996) 29–35. [Google Scholar]
  • S. Gawiejnowicz, A note on scheduling on a single processor with speed dependent on a number of executed jobs. Inf. Process. Lett. 57 (1996) 297–300. [Google Scholar]
  • S. Gawiejnowicz, Models and Algorithms of Time-Dependent Scheduling. Springer-Verlag, Berlin (2020). [Google Scholar]
  • A.V. Goldberg and R.E. Tarjan, A new approach to the maximum-flow problem. J. Assoc. Comput. Mach. 35 (1988) 921–940. [Google Scholar]
  • A.V. Goldberg, S.A. Plotkin and P.M. Vaidya, Sublinear-time parallel algorithms for matching and related problems. White Plains, New York, USA (1988) 174–185. [Google Scholar]
  • A.V. Goldberg, S.A. Plotkin, D.B. Shmoys and E. Tardos, Using interior-point methods for fast parallel algorithms for bipartite matching and related problems. SIAM J. Comput. 21 (1992) 140–150. [Google Scholar]
  • H. Hoogeveen and G.J. Woeginger, Some comments on sequencing with controllable processing times. Computing 68 (2002) 181–192. [Google Scholar]
  • J.J. Kanet, Minimizing variation of flow time in single machine systems. Manage. Sci. 27 (1981) 1453–1459. [Google Scholar]
  • S. Karhia and D. Shabtay, Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties. Int. J. Prod. Res. 56 (2018) 3080–3096. [Google Scholar]
  • H.W. Kuhn, The Hungarian method for the assignment problem. Nav. Res. Logistics Q. 2 (1955) 83–97. [Google Scholar]
  • G. Li, M.-L. Luo, W.-J. Zhang and X.-Y. Wang, Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. Int. J. Prod. Res. 53 (2015) 1228–1241. [Google Scholar]
  • L. Li, P. Yan, P. Ji and J.-B. Wang, Scheduling jobs with simultaneous considerations of controllable processing times and learning effect. Neural Comput. App. 29 (2018) 1155–1162. [Google Scholar]
  • S.D. Liman, S.S. Panwalkar and S. Thongmee, A single machine scheduling problem with common due window and controllable processing times. Ann. Oper. Res. 70 (1997) 145–154. [Google Scholar]
  • S.D. Liman, S.S. Panwalkar and S. Thongmee, Common due window size and location determination in a single machine scheduling problem. J. Oper. Res. Soc. 49 (1998) 1007–1010. [Google Scholar]
  • S.-S. Lin, Due-window assignment and resource allocation scheduling with truncated learning effect and position-dependent weights. Discrete Dyn. Nat. Soc. 2020 (2020) 9260479. [Google Scholar]
  • W.-W. Liu and C. Jiang, Due date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng. Optim. 52 (2020) 74–89. [Google Scholar]
  • L. Liu, J.-J. Wang and X.-Y. Wang, Due-window assignment scheduling with resource processing times to minimise total resource consumption cost. Int. J. Prod. Res. 54 (2016) 1186–1195. [Google Scholar]
  • Y.-Y. Lu, F. Teng and Z.-X. Feng, Scheduling jobs with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects. Asia-Pac. J. Oper. Res. 32 (2015) 1550026. [Google Scholar]
  • G. Mosheiov and D. Oron, Job-dependent due-window assignment based on a common flow allowance. Found. Comput. Decis. Sci. 35 (2010) 185–195. [Google Scholar]
  • G. Mosheiov and J.B. Sidney, Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 147 (2003) 665–670. [Google Scholar]
  • E. Nowicki and S. Zdrzalka, A survey of results for sequencing problems with controllable processing times. Discrete Appl. Math. 26 (1990) 271–287. [Google Scholar]
  • S.S. Panwalkar and R. Rajagopalan, Single-machine sequencing with controllable processing times. Eur. J. Oper. Res. 59 (1992) 298–302. [Google Scholar]
  • S.S. Panwalker, 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. [Google Scholar]
  • A. Seidmann, S.S. Panwalkar and M.L. Smith, Optimal assignment of due dates for a single processor scheduling problem. Int. J. Prod. Res. 19 (1981) 393–399. [Google Scholar]
  • D. Shabtay and G. Steiner, A survey of scheduling with controllable processing times. Discrete Appl. Math. 155 (2007) 1643–1666. [Google Scholar]
  • V.A. Strusevich and K. Rustogi, Scheduling with Time-Changing Effects and Rate-Modifying Activities. Springer-Verlag, Berlin (2017). [Google Scholar]
  • L. Tai, Optimizing batch-processing operations with batch-position-based learning effects. RAIRO:OR 55 (2020) S253–S269. [Google Scholar]
  • G. Wan, B.P.C. Yen and C.L. Li, Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. Inf. Process. Lett. 79 (2001) 273–280. [Google Scholar]
  • J.-B. Wang, L. Liu and C. Wang, Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs. Appl. Math. Modell. 37 (2013) 8394–8400. [Google Scholar]
  • J.-B. Wang, D.-Y. Lv, J. Xu, P. Ji and F. Li, Bicriterion scheduling with truncated learning effects and convex controllable processing times. Int. Trans. Oper. Res. 28 (2021) 1573–1593. [Google Scholar]
  • J.-B. Wang and J.-J. Wang, Research on scheduling with job-dependent learning effect and convex resource dependent processing times. Int. J. Prod. Res. 53 (2015) 5826–5836. [Google Scholar]
  • J.-B. Wang and Z.-Q. Xia, Single machine scheduling problems with controllable processing times and total absolute differences penalties. Eur. J. Oper. Res. 177 (2007) 638–645. [Google Scholar]
  • Y.-B. Wu, L. Wan and X.-Y. Wang, Study on due-window assignment scheduling based on common flow allowance. Int. J. Prod. Econ. 165 (2015) 155–157. [Google Scholar]
  • D.-L. Yang, C.-J. Lai and S.-J. Yang, Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. Int. J. Prod. Econ. 150 (2014) 96–103. [Google Scholar]
  • N. Yin and X.-Y. Wang, Single-machine scheduling with controllable processing times and learning effect. Int. J. Adv. Manuf. Technol. 54 (2011) 743–748. [Google Scholar]
  • S. Zdrzalka, Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis. Oper. Res. Lett. 10 (1991) 519–524. [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.