This paper is devoted to the study of an extension of the job-shop, in which transport of the par... more This paper is devoted to the study of an extension of the job-shop, in which transport of the parts between the machines is taken into account. The objective is then to simultaneously schedule the machines and the vehicles, in order to minimize the makespan. Both problems are known to be NP-hard. To deal with this problem, we propose a new representation of the solutions space, and an efficient neighbouring system. Three different metaheuristics (iterated local search, simulated annealing and their hybridization) have been implemented. The results obtained are better than those in the literature, and this independently from the method used. New upper bounds are proposed for 11 of the 40 instances which compose our benchmark test.
Proceedings of the 15th IFAC World Congress, 2002, 2002
This paper addresses the simultaneous job input sequencing and vehicle dispatching problems in fl... more This paper addresses the simultaneous job input sequencing and vehicle dispatching problems in flexible manufacturing systems (FMS) using a single device Automated Guided Vehicle System (AGVS). A Branch and Bound approach based on simulation has been previously developed. However, efficient easily computable lower bounds are still required to provide solutions for small and medium size problems. In this paper a new lower bound is proposed and benchmarks proved that this lower bound outperforms the lower bound previously published.
Flexible Manufacturing Systems have received a considerable amount of attention from the research... more Flexible Manufacturing Systems have received a considerable amount of attention from the research community. This work has been achieved under a research project of the GDR RO denoted FMS. This article is not a state of the art on FMS but rather a description of research carried out in the French community and placed into the international research community in this subject. We pointout first the FMS challenging problems and second the methods of interest to address these problems.
The Job-Shop Scheduling Problem (JSSP) is well known for its complexity as an NP-hard disjunctive... more The Job-Shop Scheduling Problem (JSSP) is well known for its complexity as an NP-hard disjunctive scheduling problem. The problem addressed in this paper is JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. An efficient GRASP Â ELS approach is introduced for solving this problem. The efficiency is evaluated using the widely known 40 Laurence's instances which encompass medium and large scale instances. The computational results prove that the proposed method competes with the best published methods in both quality of results and computational time. Recently, Web services have generated great interest in researchers. Such application architecture is based on the client-server model using existing Internet protocols and open standards. It provides new approaches to optimization methods. The proposed GRASP Â ELS is packaged into a Web Service (WS), i.e., it offers for the research community an open access to our optimization approach. Moreover, the proposed web service can be even included in research future works with a very small programming effort. To favor utilization of the web service and to prove the facility in which the service could be used, we provide an example in Java proving that it is possible to obtain in less than 10 min a client application using the different methods exposed by this web service. Such usage extends to classical library inclusion in program with the difference that a method is called in the client side and represents an execution on the server. The Web Service paradigm is a new approach in spreading algorithms and therefore this paper stands at the crossroads of optimization research community and the web service community expectations. The GRASP Â ELS provided in the web service, is a state of the art method which competes with previously published ones and which has the advantage of being available for free, in any languages, everywhere contributing in spreading operational research contribution.
This paper looks at how several modelling approaches may be taken into account simultaneously whe... more This paper looks at how several modelling approaches may be taken into account simultaneously when a modelling process and a methodology dedicated to an Urban Traffic Systems (UTS) domain, are provided. A methodology is presented which features a generic knowledge model that is built using an object-oriented approach. This multi-modeling capability is provided by an incremental modeling process.
Un e nv i r o nne m e nt d e m o d é l i s a t i o n p o u r l e s y s t è m e d ' i nf o r m a t... more Un e nv i r o nne m e nt d e m o d é l i s a t i o n p o u r l e s y s t è m e d ' i nf o r m a t i o n d e l a S u p p l y C h a i n : a p p l i c a t i o n a u N o u v e l H ô p i t a l d ' E s t a i ng Michelle Chabrol¹, P ierre F é n iè s², Michel G ou rg an d ¹, N ik olay T chern ev ²
International Journal of Production Research, 2005
... As stressed by Ganesharajah et al. (199815. Ganesharajah, T, Hall, NG and Sriskandarajah, C. ... more ... As stressed by Ganesharajah et al. (199815. Ganesharajah, T, Hall, NG and Sriskandarajah, C. 1998. Design and operational issues in AGV-served manufacturing systems. Ann. Oper. ... To avoid the deadlock any FMS (Cho et al. 19958. Cho, H, Kumaran, T and Wysk, R. 1995. ...
This paper is devoted to the study of an extension of the job-shop, in which transport of the par... more This paper is devoted to the study of an extension of the job-shop, in which transport of the parts between the machines is taken into account. The objective is then to simultaneously schedule the machines and the vehicles, in order to minimize the makespan. Both problems are known to be NP-hard. To deal with this problem, we propose a new representation of the solutions space, and an efficient neighbouring system. Three different metaheuristics (iterated local search, simulated annealing and their hybridization) have been implemented. The results obtained are better than those in the literature, and this independently from the method used. New upper bounds are proposed for 11 of the 40 instances which compose our benchmark test.
Proceedings of the 15th IFAC World Congress, 2002, 2002
This paper addresses the simultaneous job input sequencing and vehicle dispatching problems in fl... more This paper addresses the simultaneous job input sequencing and vehicle dispatching problems in flexible manufacturing systems (FMS) using a single device Automated Guided Vehicle System (AGVS). A Branch and Bound approach based on simulation has been previously developed. However, efficient easily computable lower bounds are still required to provide solutions for small and medium size problems. In this paper a new lower bound is proposed and benchmarks proved that this lower bound outperforms the lower bound previously published.
Flexible Manufacturing Systems have received a considerable amount of attention from the research... more Flexible Manufacturing Systems have received a considerable amount of attention from the research community. This work has been achieved under a research project of the GDR RO denoted FMS. This article is not a state of the art on FMS but rather a description of research carried out in the French community and placed into the international research community in this subject. We pointout first the FMS challenging problems and second the methods of interest to address these problems.
The Job-Shop Scheduling Problem (JSSP) is well known for its complexity as an NP-hard disjunctive... more The Job-Shop Scheduling Problem (JSSP) is well known for its complexity as an NP-hard disjunctive scheduling problem. The problem addressed in this paper is JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. An efficient GRASP Â ELS approach is introduced for solving this problem. The efficiency is evaluated using the widely known 40 Laurence's instances which encompass medium and large scale instances. The computational results prove that the proposed method competes with the best published methods in both quality of results and computational time. Recently, Web services have generated great interest in researchers. Such application architecture is based on the client-server model using existing Internet protocols and open standards. It provides new approaches to optimization methods. The proposed GRASP Â ELS is packaged into a Web Service (WS), i.e., it offers for the research community an open access to our optimization approach. Moreover, the proposed web service can be even included in research future works with a very small programming effort. To favor utilization of the web service and to prove the facility in which the service could be used, we provide an example in Java proving that it is possible to obtain in less than 10 min a client application using the different methods exposed by this web service. Such usage extends to classical library inclusion in program with the difference that a method is called in the client side and represents an execution on the server. The Web Service paradigm is a new approach in spreading algorithms and therefore this paper stands at the crossroads of optimization research community and the web service community expectations. The GRASP Â ELS provided in the web service, is a state of the art method which competes with previously published ones and which has the advantage of being available for free, in any languages, everywhere contributing in spreading operational research contribution.
This paper looks at how several modelling approaches may be taken into account simultaneously whe... more This paper looks at how several modelling approaches may be taken into account simultaneously when a modelling process and a methodology dedicated to an Urban Traffic Systems (UTS) domain, are provided. A methodology is presented which features a generic knowledge model that is built using an object-oriented approach. This multi-modeling capability is provided by an incremental modeling process.
Un e nv i r o nne m e nt d e m o d é l i s a t i o n p o u r l e s y s t è m e d ' i nf o r m a t... more Un e nv i r o nne m e nt d e m o d é l i s a t i o n p o u r l e s y s t è m e d ' i nf o r m a t i o n d e l a S u p p l y C h a i n : a p p l i c a t i o n a u N o u v e l H ô p i t a l d ' E s t a i ng Michelle Chabrol¹, P ierre F é n iè s², Michel G ou rg an d ¹, N ik olay T chern ev ²
International Journal of Production Research, 2005
... As stressed by Ganesharajah et al. (199815. Ganesharajah, T, Hall, NG and Sriskandarajah, C. ... more ... As stressed by Ganesharajah et al. (199815. Ganesharajah, T, Hall, NG and Sriskandarajah, C. 1998. Design and operational issues in AGV-served manufacturing systems. Ann. Oper. ... To avoid the deadlock any FMS (Cho et al. 19958. Cho, H, Kumaran, T and Wysk, R. 1995. ...
Uploads
Papers by N. Tchernev