Space and time allocation in a shipyard assembly hall

DOI10.1007/s10479-008-0461-8zbMath1201.90109OpenAlexW1992749950MaRDI QIDQ610963

Maud Bay, Yves Langer, Philippe Rigo, Yves Cramer

Publication date: 13 December 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://orbi.uliege.be/handle/2268/28166

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (1)

SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING

Uses Software

• COMET
• Algorithm 864

Cites Work

• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Local search algorithms for the rectangle packing problem with general spatial costs
• Local search with constraint propagation and conflict-based heuristics
• Guided local search and its application to the traveling salesman problem
• A typology of cutting and packing problems
• Two-dimensional packing problems: a survey
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• A General Purpose Algorithm for Three-Dimensional Packing
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Parallel Local Search in Comet
• Local Search and Constraint Programming
• The Three-Dimensional Bin Packing Problem
• Variable neighborhood search: Principles and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Space and time allocation in a shipyard assembly hall