UNIGE document Doctoral Thesis
previous document  unige:73544  next document
add to browser collection
Title

Metaheuristics for constrained production scheduling problems

Author
Director
Defense Thèse de doctorat : Univ. Genève, 2015 - GSEM 9 - 2015/06/01
Abstract In this thesis, high level metaheuristics are proposed to solve production scheduling problems. Production scheduling is a crucial function for companies, which helps to manage the operations at the production shop level. It aims to reduce the costs, to increase the service level to customers, and to achieve better production efficiency. The design of powerful optimization methods for such problems is then decisive for the competitiveness of the companies. This thesis is divided into five chapters which focus on different production scheduling problems. For each problem, an integer linear programming formulation is given, and various heuristics and metaheuristics are proposed and compared. The first two chapters concern an extension of the graph coloring problem, which is extended to correspond to realistic job scheduling problems. Chapters three and four are related to a single machine scheduling problem. The last chapter studies the integration of short term supply chain management decisions.
Keywords MetaheuristicsSchedulingSupply chain management
Identifiers
URN: urn:nbn:ch:unige-735445
Full text
Thesis (1.5 MB) - document accessible for UNIGE members only Limited access to UNIGE
Structures
Citation
(ISO format)
THEVENIN, Simon. Metaheuristics for constrained production scheduling problems. Université de Genève. Thèse, 2015. https://archive-ouverte.unige.ch/unige:73544

189 hits

6 downloads

Update

Deposited on : 2015-06-24

Export document
Format :
Citation style :