Open Access
RAIRO-Oper. Res.
Volume 57, Number 3, May-June 2023
Page(s) 1353 - 1375
Published online 21 June 2023
  • Z. Abtahi and R. Sahraeian, Robust and stable flow shop scheduling problem under uncertain processing times and machines’ disruption. Int. J. Eng. 34 (2021) 935–947. [Google Scholar]
  • A. Allahverdi, The tricriteria two-machine flowshop scheduling problem. Int. Trans. Oper. Res. 8 (2001) 403–425. [Google Scholar]
  • A. Allahverdi, A survey of scheduling problems with uncertain interval/bounded processing/setup times. J. Project Manage. 7 (2022) 255–264. [CrossRef] [Google Scholar]
  • M. Allahverdi and A. Allahverdi, Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan. RAIRO: Oper. Res. 54 (2020) 529–553. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
  • M. Allahverdi and A. Allahverdi, Minimizing total completion time for flowshop scheduling problem with uncertain processing times. RAIRO: Oper. Res. 55 (2021) S929–S946. [CrossRef] [EDP Sciences] [Google Scholar]
  • A. Allahverdi and H. Aydilek, Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times. Comput. Math. App. 60 (2010) 1374–1384. [Google Scholar]
  • A. Allahverdi and H. Aydilek, The two stage assembly flowshop scheduling problem to minimize total tardiness. J. Intell. Manuf. 26 (2015) 225–237. [CrossRef] [Google Scholar]
  • A. Allahverdi and Y. Sotskov, Two-machine flowshop minimum-length scheduling problem with random and bounded processing times. Int. Trans. Oper. Res. 10 (2003) 65–76. [CrossRef] [MathSciNet] [Google Scholar]
  • A. Allahverdi, H. Aydilek and A. Aydilek, Two-stage assembly scheduling problem for minimizing total tardiness with setup times. Appl. Math. Modell. 40 (2016) 7796–7815. [CrossRef] [Google Scholar]
  • M. Allahverdi, H. Aydilek, A. Aydilek and A. Allahverdi, A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure. J. Ind. Manage. Optim. 17 (2021) 1973. [CrossRef] [Google Scholar]
  • S. Arabameri and N. Salmasi, Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem. Comput. Ind. Eng. 64 (2013) 902–916. [CrossRef] [Google Scholar]
  • O.A. Arık, Single machine earliness/tardiness scheduling problem with grey processing times and the grey common due date. Grey Syst.: Theory App. 11 (2021) 95–109. [Google Scholar]
  • A. Aydilek, H. Aydilek and A. Allahverdi, Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times. Appl. Math. Modell. 45 (2017) 982–996. [CrossRef] [Google Scholar]
  • H. Aydilek, A. Aydilek, M. Allahverdi and A. Allahverdi, More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness. Int. J. Ind. Eng. Comput. 13 (2022) 543–556. [Google Scholar]
  • W. Bożejko, M. Uchroński and M. Wodecki, Blocks for two-machines total weighted tardiness flow shop scheduling problem. Bull. Polish Acad. Sci. Tech. Sci. 68 (2020) 31–41. [Google Scholar]
  • B. de Athayde Prata, V. Fernandez-Viagas, J.M. Framinan and C.D. Rodrigues, Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. Comput. Oper. Res. 145 (2022) 105880. [CrossRef] [Google Scholar]
  • J. Ding, S. Song, R. Zhang, J.N. Gupta and C. Wu, Accelerated methods for total tardiness minimisation in no-wait flowshops. Int. J. Prod. Res. 53 (2015) 1002–1018. [CrossRef] [Google Scholar]
  • J. Du and J.Y.T. Leung, Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15 (1990) 483–495. [CrossRef] [MathSciNet] [Google Scholar]
  • J.M. Framinan and R. Leisten, Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm. Int. J. Prod. Res. 46 (2008) 6479–6498. [CrossRef] [Google Scholar]
  • E.M. Gonzalez-Neira, D. Ferone, S. Hatami and A.A. Juan, A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times. Simul. Modell. Pract. Theory 79 (2017) 23–36. [CrossRef] [Google Scholar]
  • S.C. Horng and S.S. Lin, Apply ordinal optimization to optimize the job-shop scheduling under uncertain processing times. Arabian J. Sci. Eng. 47 (2022) 9659–9671. [CrossRef] [Google Scholar]
  • T. Keshavarz and N. Salmasi, Makespan minimisation in flexible flowshop sequence-dependent group scheduling problem. Int. J. Prod. Res. 51 (2013) 6182–6193. [CrossRef] [Google Scholar]
  • Y.D. Kim, A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Comput. Oper. Res. 20 (1993) 391–401. [CrossRef] [MathSciNet] [Google Scholar]
  • M.A. Rakrouki, A. Aljohani and T. Ladhari, Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraints. Intell. Autom. Soft Comput. 35 (2023) 1119–1134. [CrossRef] [Google Scholar]
  • R.G. Saber and M. Ranjbar, Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem. Comput. Oper. Res. 138 (2022) 105604. [CrossRef] [Google Scholar]
  • H. Seidgar, M. Kiani, M. Abedi and H. Fazlollahtabar, An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem. Int. J. Prod. Res. 52 (2014) 1240–1256. [CrossRef] [Google Scholar]
  • D.K. Seo, C.M. Klein and W. Jang, Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models. Comput. Ind. Eng. 48 (2005) 153–161. [CrossRef] [Google Scholar]
  • Y.N. Sotskov and N.G. Egorova, The optimality region for a single-machine scheduling problem with bounded durations of the jobs and the total completion time objective. Mathematics 7 (2019) 382. [CrossRef] [Google Scholar]
  • Y.N. Sotskov, N.M. Matsveichuk and V.D. Hatsura, Two-machine job-shop scheduling problem to minimize the makespan with uncertain job durations. Algorithms 13 (2019) 4. [CrossRef] [Google Scholar]
  • Y.N. Sotskov, N.M. Matsveichuk and V.D. Hatsura, Schedule execution for two-machine job-shop to minimize makespan with uncertain processing times. Mathematics 8 (2020) 1314. [CrossRef] [Google Scholar]
  • P. Tayanithi, S. Manivannan and J. Banks, A knowledge-based simulation architecture to analyze interruptions in a flexible manufacturing system. J. Manuf. Syst. 11 (1992) 195–214. [Google Scholar]
  • E. Vallada and R. Ruiz, Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega 38 (2010) 57–67. [CrossRef] [Google Scholar]
  • E. Vallada, R. Ruiz and G. Minella, Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics. Comput. Oper. Res. 35 (2008) 1350–1373. [CrossRef] [Google Scholar]
  • K. Wang and S.H. Choi, A decomposition-based approach to flexible flow shop scheduling under machine breakdown. Int. J. Prod. Res. 50 (2012) 215–234. [Google Scholar]
  • Z.Y. Wang, Q.K. Pan, L. Gao and Y.L. Wang, An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem. Swarm Evol. Comput. 74 (2022) 101143. [CrossRef] [Google Scholar]
  • W. Xu, W. Wu, Y. Wang, Y. He and Z. Lei, Flexible job-shop scheduling method based on interval grey processing time. Appl. Intell. (2022) 1–16. DOI: [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.