Documents disponibles écrits par cet auteur

A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem / S-Q. Liu in Journal of the operational research society (JORS), Vol. 63 N° 2 (Fevrier 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 168–182 Titre : A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem Type de document : texte imprimé Auteurs : S-Q. Liu, Auteur ; E. Kozan, Auteur Année de publication : 2012 Article en page(s) : pp. 168–182 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Heuristics  Parallel-machine  Job-shop  Shifting  bottleneck  procedure  Metaheuristics Index. décimale : 001.424 Résumé : In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search (TS) metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version shifting bottleneck procedure (SBP) algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: (i) a topological-sequence algorithm is proposed to decompose the PMJSS problem in a set of single-machine scheduling (SMS) and/or parallel-machine scheduling subproblems; (ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; (iii) the Jackson rule is extended to solve the PMS subproblem; (iv) a TS metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors20114a.html [article] A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem [texte imprimé] / S-Q. Liu, Auteur ; E. Kozan, Auteur . - 2012 . - pp. 168–182. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 168–182 Mots-clés : Scheduling  Heuristics  Parallel-machine  Job-shop  Shifting  bottleneck  procedure  Metaheuristics Index. décimale : 001.424 Résumé : In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search (TS) metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version shifting bottleneck procedure (SBP) algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: (i) a topological-sequence algorithm is proposed to decompose the PMJSS problem in a set of single-machine scheduling (SMS) and/or parallel-machine scheduling subproblems; (ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; (iii) the Jackson rule is extended to solve the PMS subproblem; (iv) a TS metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors20114a.html

Optimising container storage processes at multimodal terminals / B. Casey in Journal of the operational research society (JORS), Vol. 63 N° 8 (Août 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 8 (Août 2012) . - pp. 1126–1142 Titre : Optimising container storage processes at multimodal terminals Type de document : texte imprimé Auteurs : B. Casey, Auteur ; E. Kozan, Auteur Année de publication : 2012 Article en page(s) : pp. 1126–1142 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Heuristics  Container  Multimodal  Sea  transport Index. décimale : 001.424 Résumé : Multimodal Container Terminals (MMCT) require comprehensive planning, programming and control in order to operate an efficient storage system. In this paper, a model has been developed for the storage system of the MMCT. It is an extension of the Blocks Relocation Problem, with incoming as well as outgoing containers, or ‘blocks’. The model deals with assigning containers to positions within the storage area, rehandling of containers to be retrieved, and calculation of the processing times in order to perform these actions. A number of constructive heuristics are presented in order to produce good initial solutions for this problem. Meta-heuristics are also used to improve on these solutions. Results from the various heuristics on a few case study problems are compared and discussed. This research will also provide a core piece of technology for the development of autonomous container handling systems for terminals. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n8/abs/jors2011113a.html [article] Optimising container storage processes at multimodal terminals [texte imprimé] / B. Casey, Auteur ; E. Kozan, Auteur . - 2012 . - pp. 1126–1142. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 8 (Août 2012) . - pp. 1126–1142 Mots-clés : Heuristics  Container  Multimodal  Sea  transport Index. décimale : 001.424 Résumé : Multimodal Container Terminals (MMCT) require comprehensive planning, programming and control in order to operate an efficient storage system. In this paper, a model has been developed for the storage system of the MMCT. It is an extension of the Blocks Relocation Problem, with incoming as well as outgoing containers, or ‘blocks’. The model deals with assigning containers to positions within the storage area, rehandling of containers to be retrieved, and calculation of the processing times in order to perform these actions. A number of constructive heuristics are presented in order to produce good initial solutions for this problem. Meta-heuristics are also used to improve on these solutions. Results from the various heuristics on a few case study problems are compared and discussed. This research will also provide a core piece of technology for the development of autonomous container handling systems for terminals. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n8/abs/jors2011113a.html

Optimization of container process at seaport terminals / A. Wong in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 658–665 Titre : Optimization of container process at seaport terminals Type de document : texte imprimé Auteurs : A. Wong, Auteur ; E. Kozan, Auteur Année de publication : 2010 Article en page(s) : pp. 658–665 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Sea  transport  Logistics  Heuristics Index. décimale : 001.424 Résumé : Seaport container terminals are an important part of the logistics systems in international trades. This paper investigates the relationship between quay cranes, yard machines and container storage locations in a multi-berth and multi-ship environment. The aims are to develop a model for improving the operation efficiency of the seaports and to develop an analytical tool for yard operation planning. Due to the fact that the container transfer times are sequence-dependent and with the large number of variables involved, the proposed model cannot be solved in a reasonable time interval for realistically sized problems. For this reason, List Scheduling and Tabu Search algorithms have been developed to solve this formidable and NP-hard scheduling problem. Numerical implementations have been analysed and promising results have been achieved. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200918a.html [article] Optimization of container process at seaport terminals [texte imprimé] / A. Wong, Auteur ; E. Kozan, Auteur . - 2010 . - pp. 658–665. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 658–665 Mots-clés : Scheduling  Sea  transport  Logistics  Heuristics Index. décimale : 001.424 Résumé : Seaport container terminals are an important part of the logistics systems in international trades. This paper investigates the relationship between quay cranes, yard machines and container storage locations in a multi-berth and multi-ship environment. The aims are to develop a model for improving the operation efficiency of the seaports and to develop an analytical tool for yard operation planning. Due to the fact that the container transfer times are sequence-dependent and with the large number of variables involved, the proposed model cannot be solved in a reasonable time interval for realistically sized problems. For this reason, List Scheduling and Tabu Search algorithms have been developed to solve this formidable and NP-hard scheduling problem. Numerical implementations have been analysed and promising results have been achieved. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200918a.html