Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming

DOI10.3138/INFOR.45.2.65OpenAlexW2097726770MaRDI QIDQ6102811FDOQ6102811

Dominique Feillet, Yves Dallery, Philippe Michelon, Fabrice Alizon

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.45.2.65

zbMATH Keywords

constraint programmingsupply chain managementfacility layoutassembly line

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Introducing global constraints in CHIP
• Constraint satisfaction problems: Algorithms and applications
• Enhanced Model Formulations for Optimal Facility Layout
• A simulated annealing algorithm for allocating space to manufacturing cells
• A new mixed integer programming formulation for facility layout design using flexible bays
• Constraint and integer programming. Toward a unified methodology.
• Lagrangean methods for the 0-1 quadratic knapsack problem
• A new mathematical-programming framework for facility-layout design
• SHAPE: A construction algorithm for area placement evaluation
• An integrated approach to the facilities and material handling system design

Cited In (3)

• An efficient algorithm for unequal area facilities layout planning with input and output points
• Title not available (Why is that?)
• Using Constraint Satisfaction Approach to Solve the Capacity Allocation Problem for Photolithography Area

This page was built for publication: Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102811)