Survey of research in the design and control of automated guided vehicle systems

http://www.upv.es/deioac/Investigacion/revision.pdf

The hybrid flow shop scheduling problem

Purpose – Managing the green (environmentally sustainable) supply chain is an important issue for industry. This paper aims to provide a framework to understand and appreciate the relationships of various research streams and topics in this field. Utilizing this framework, emergent research directions to advance the field are also presented.Design/methodology/approach – Published research in peer‐reviewed journals is evaluated using a new framework of nine non‐exclusive, interrelated boundaries and five flows of resources related to green supply chains and supply chain management.Findings – The research literature can be integrated into these comprehensive multidimensional frameworks, which also provide opportunities as vehicles for future research. Research directions are described utilizing the framework presented in this paper.Research limitations/implications – This work presents one potential set of frameworks. Insights relating to other potential frameworks are additional areas of investigation and ...

A boundaries and flows perspective of green supply chain management

Simulation for manufacturing system design and operation: Literature review and analysis

Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

This paper deals with the problem of allocating berth positions for vessels in export bulk port terminals considering tidal constraints and was first formulated by Ernst et al., (2017). This study investigates the dynamic and continuous berth allocation problem (BAP) with respect to tidal constraints (BAP_TC), and seeks to minimize the total service time of berthed vessels. Since the BAP problem is NP-hard the BAP_TC is also NP-hard. A reduced variable neighborhood search (RVNS) based approach is developed to solve the problem. For parameters tuning a machine learning algorithm is developed and used. Problem instances are benchmarked with CPLEX and the numerical experiments proved that the proposed algorithm is capable of generating high-quality solutions in rather short time. Both small and large-scale instances in the literature are tested to evaluate the metaheuristic effectiveness using other solution approaches from the literature. The computational experiment proves that the proposed algorithm provides state of the art results.

A reduced VNS based approach for the dynamic continuous berth allocation problem in bulk terminals with tidal constraints

This paper objective is to propose an approach and a modelling environment for the design of Supply Chain Information System and decisional tools. This software environment is an integrated set of tools and methods organized in order to model and evaluate Supply Chain performance. The interactions between Supply Chain entities and the problems complexity for Supply Chain Manager and Data Processing Specialist show that it is necessary to conceive and implement a modelling environment for Supply Chain. The method is applied on a real case study, the New Hospital Estaing.

Un environnement de modélisation pour le système d'information de la Supply Chain : Application au Nouvel Hôpital Estaing

This paper addresses an important issue in manufacturing by considering the scheduling of a Job-shop like manufacturing system involving a power threshold that must not be exceeded over time. A power profile is attached to operations that must be scheduled. This power profile presents a consumption peak at the start of process in order to model most of real-world machining operations. These operations must be scheduled according to the instantly available power threshold. A mathematical formulation of the problem is proposed; its main goal is to minimise the total completion time of all operations. A set of instances is built based on classical format of instances for the Job-shop problem. As it is time-consuming to obtain exact solutions on these instances with the CPLEX solver, a Greedy Randomised Adaptive Search Procedure hybridised with an Evolutionary Local Search (GRASP × ELS) metaheuristic is designed. The GRASP × ELS is compared with two other metaheuristics: a Variable Neighbourhood Search and a ...

Job-shop like manufacturing system with variable power threshold and operations with power requirements

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 GRASPxELS 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 GRASPxELS 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 10min 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 GRASPxELS 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.

Nikolay Tchernev

Papers

A reduced VNS based approach for the dynamic continuous berth allocation problem in bulk terminals with tidal constraints

Un environnement de modélisation pour le système d'information de la Supply Chain : Application au Nouvel Hôpital Estaing

Job-shop like manufacturing system with variable power threshold and operations with power requirements

A GRASP×ELS approach for the job-shop with a web service paradigm packaging

A Job-shop with an Energy Threshold Issue Considering Operations with Consumption Peaks