Solving a job shop scheduling problem on the line of treatment surface and automation of production system

In this thesis we study the automated electroplating lines. In these lines, the products are immerged in different tanks. The processing times are bounded. The lower bound represents the minimum time to treat the product while the upper bound depends on the treatment.A classical objective is to find the robot moves which minimize the cycle time, this is called ”hoist scheduling problem” (HSP). In this thesis, we study particularly the single-hoist/multi-products.In this direction, three approaches are presented to solve the single-hoist/multi-products problem with introducing the hoist moves time: constraints satisfaction algorithm based on non standard criteria witch the hoist wait time, hybridization with classical heuristics improving the obtained results, and finally the genetic algorithm to optimize the cycle time. Robustness’ notions are finally exploited in the presence of a disturbance at the critical resource of the workshop which is the hoist.The systematic determination of a robust scheduling has been conducted successfully introducing new performance indicators and by applying a multicriteria evaluation method

Data and Resources

Additional Info

Field Value
Source https://theses.hal.science/tel-00992026
Author Mhedhbi, Imen
Maintainer CCSD
Last Updated May 5, 2026, 11:03 (UTC)
Created May 5, 2026, 11:03 (UTC)
Identifier NNT: 2011ECLI0004
Language fr
Rights https://about.hal.science/hal-authorisation-v1/
contributor Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS) ; Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)
creator Mhedhbi, Imen
date 2011-04-11T00:00:00
harvest_object_id 5f034b38-7667-492e-ae73-7bd5bf2c51e1
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-05-04T00:00:00
set_spec type:THESE