ROADEF 2017
Free Access
Issue
RAIRO-Oper. Res.
Volume 54, Number 2, March-April 2020
ROADEF 2017
Page(s) 555 - 568
DOI https://doi.org/10.1051/ro/2019116
Published online 03 March 2020
  • A. Agnetis, M. Flamini, G. Nicosia and A. Pacifici, A job shop problem with one additional resource type. J. Scheduling 14 (2010) 225–237. [CrossRef] [Google Scholar]
  • A. Agnetis, G. Murgia and S. Sbirilli, A job shop scheduling problem with human operators in handicraft production. Int. J. Prod. Res. 52 (2014) 3820–3831. [Google Scholar]
  • M. Al-Salem and M. Kharbeche, Throughput optimization for the robotic cell problem with controllable processing times. RAIRO: OR 51 (2017) 805–818. [CrossRef] [Google Scholar]
  • Y.P. Aneja and H. Kamoun, Scheduling of parts and robot activities in a two machine robotic cell. Comput. Oper. Res. 26 (1999) 297–312. [Google Scholar]
  • K.R. Baker, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Oper. Res. 31 (1983) 381–386. [Google Scholar]
  • M.F. Baki, Some Problems in One-Operator Scheduling. Ph.D. thesis. University of Waterloo (1999). [Google Scholar]
  • P. Baptiste and A. Munier, Ordonnancement sur machines parallèles avec partage d’opérateurs. In: 10ème Congrès International de Génie Industriel-CIGI 2013 (2013). [Google Scholar]
  • P. Baptiste, V. Giard, A. Hait and F. Soumis, Gestion de production et ressources humaines. Presses Internationales Polytechnique (2005). [Google Scholar]
  • I. Benkalai, P. Baptiste and D. Rebaine, Ordonnancement d’ateliers de type flow shop avec contrainte d’opérateurs. In: 11ème Congrès International de Génie Industriel-CIGI 2015 (2015). [Google Scholar]
  • I. Benkalai, P. Baptiste and D. Rebaine, Ordonnancement d’ateliers de type flow shop avec opérateurs en mode d’affectation libre. In: 17 ème conférence ROADEF (2016). [Google Scholar]
  • I. Benkalai, P. Baptiste and D. Rebaine, Ordonnancement d’ateliers de type flow shop avec opérateurs en mode d’affectation libre. In: 17ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et Aide à la Décision (2016). [Google Scholar]
  • I. Benkalai, D. Rebaine and P. Baptiste, Assigning operators in a flow shop environment. In: Information Systems, Logistics and Supply Chain (2016). [Google Scholar]
  • I. Benkalai, D. Rebaine and P. Baptiste, Scheduling flow shops with operators. Int. J. Prod. Res. 57 (2019) 338–356. [Google Scholar]
  • C. Bierwirth, A generalized permutation approach to jobshop scheduling with genetic algorithms. Oper. Res. Spectr. 17 (1995) 87–92. [CrossRef] [Google Scholar]
  • J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Handbook on scheduling: From theory to applications. Springer (2007). [Google Scholar]
  • T.C.E. Cheng, G. Wang and C. Sriskandarajah, One-operator-two-machine flowshop scheduling with setup and dismounting times. Comput. Oper. Res. 26 (1999) 715–730. [Google Scholar]
  • M. Cheurfa, Gestion des ressources humaines en production cyclique. Ph.D. thesis. ENSM Saint-Étienne (2005). [Google Scholar]
  • M. Dawande, H.N. Geismar, S.P. Sethi and C. Sriskandarajah, Sequencing and scheduling in robotic cells: Recent developments. J. Scheduling 8 (2005) 387–426. [CrossRef] [Google Scholar]
  • H.N. Geismar, M. Pinedo and C. Sriskandarajah, Robotic cells with parallel machines and multiple dual gripper robots: a comparative overview. IIE Trans. 40 (2008) 1211–1227. [Google Scholar]
  • B. Giffler and G.L. Thompson, Algorithms for solving production scheduling problems. Oper. Res. 8 (1960) 487–503. [Google Scholar]
  • N. Grangeon, M. Gourgand and N. Klement, Activities planning and resources assignment on distinct places: a mathematical model. RAIRO: OR 49 (2015) 79–98. [CrossRef] [Google Scholar]
  • E.L. Lawler, Preemptive scheduling of precedence-constrained jobs on parellel machines. In: Deterministic and Stochastic Scheduling, Proceedings of the NATO Advanced Study and Reasearch Institute on Theoretical Approaches to Scheduling Problems. D. Reidel publishing Co. (1982) 101–123. [Google Scholar]
  • C. Mencia, M.R. Sierra, M.A. Salido, J. Escamilla and R. Varela, Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules. Artif. Intell. Commun. 28 (2015) 365–381. [Google Scholar]
  • R. Mencia, M.R. Sierra, C. Mencia and R. Varela, Genetic algorithm for job shop with operatos, edited by J.M. Ferrandez, J.R. Alvarez Sanchez, F. de la Paz and F.J. Toledo. In: Vol. 6687 of New challenges on bioinspired applications. IWINAC. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg (2011). [Google Scholar]
  • C. Mencia, M.R. Sierra and R. Varela, An efficient hybrid search algorithm for job shop scheduling with operators. Int. J. Prod. Res. 51 (2013) 5221–5237. [Google Scholar]
  • R. Mencia, M.R. Sierra, C. Mencia and R. Varela, A genetic algorithm for job shop scheduling with operators enhanced by weal lamarckian evolution and search space narrowing. Nat. Comput. 13 (2014) 179–192. [Google Scholar]
  • R. Mencia, M.R. Sierra, C. Mencia and R. Varela, Memetic algorithms for the job shop scheduling problem with operators. Appl. Soft Comput. 34 (2015) 94–105. [Google Scholar]
  • M. Paul and S. Knust, A classification scheme for integrated staff rostering and scheduling problems. RAIRO: OR 49 (2015) 393–412. [CrossRef] [Google Scholar]
  • M. Pinedo, Scheduling: Theory, Algorithms and Systems. Prentice Hall (2002). [Google Scholar]
  • S.P. Sethi, C. Sriskandarajah, G. Sorger, J. Blazewicz and W. Kubiak, Sequencing of parts and robot moves in a robotic cell. Int. J. Flexible Manuf. Syst. 4 (1992) 331–358. [CrossRef] [Google Scholar]
  • N. Shivasankaran, S.P. Kumar, G. Nallakumarasamy and K. Venkatesh Raja, Repair shop job scheduling with parallel operators and multiple constraints using simulated annealing. Int. J. Comput. Intell. Syst. 6 (2013) 223–233. [CrossRef] [Google Scholar]
  • M.R. Sierra, C. Mencia and R. Varela, Optimally scheduling a job shop with operators and total flow time, edited by J.A. Lozana, J.A. Ganaz and J.A. Moreno. In: Vol. 7027 of Advances in Artificial intelligence. CAEPIA. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg (2011). [Google Scholar]
  • M.R. Sierra, C. Mencia and R. Varela, New schedule generation schemes for the job shop problem with operators. J. Intell. Manuf. 26 (2015) 511–525. [Google Scholar]
  • J.D. Ullman, Complexity of sequencing problems. In: Computer and Job/Shop Scheduling Theory. Wiley & Sons, Inc., New York (1976). [Google Scholar]
  • R.G. Vickson, Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Oper. Res. 28 (1980) 1155–1167. [Google Scholar]
  • R.G. Vickson, Two single machine sequencing problems involving controllable job processing times. AIIE Trans. 12 (1980) 258–262. [CrossRef] [Google Scholar]
  • M. Zouba, Ordonnancement de machines parallèles identiques avec des contraintes de ressources humaines. Ph.D. thesis, École Polytechnique Montréal (2009). [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.