Complete Characterization of $\epsilon$-approximate Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem

International audience

Data and Resources

Additional Info

Field Value
Source Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Author Billaut, Jean-Charles, Hébrard, Emmanuel, Lopez, Pierre
Maintainer CCSD
Last Updated May 15, 2026, 17:59 (UTC)
Created May 15, 2026, 17:59 (UTC)
Identifier hal-00676783
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT) ; Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL) ; Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)
coverage Nantes, France
creator Billaut, Jean-Charles
date 2012-05-28T00:00:00
harvest_object_id e3b7e6e6-9d76-4e79-b384-bb4b80930f6d
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-11-04T00:00:00
set_spec type:COMM