https://www.mansci.ovgu.de/mansci_media/publikationen/2007/typology-EGOTEC-5t0pvr6fjifln4r4oav60tt612.pdf

An improved typology of cutting and packing problems

http://www.upv.es/deioac/Investigacion/revision.pdf

The hybrid flow shop scheduling problem

Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

At cross docking terminals incoming deliveries of inbound trucks are unloaded, sorted, moved across the dock and finally loaded onto outbound trucks, which immediately leave the terminal towards their next destination in the distribution chain. Accordingly, a cross dock is a consolidation point in a distribution network, where multiple smaller shipments can be merged to full truck loads in order to realize economies in transportation. In this context, the truck scheduling problem, which decides on the succession of truck processing at the dock doors, is especially important to ensure a rapid turnover and on-time deliveries. Due to its high real-world significance, several truck scheduling procedures have been introduced during recent years, which all treat specific cross dock settings. In order to structure and promote scientific progress, this paper introduces a classification of deterministic truck scheduling. With the help of this classification, existing literature is reviewed and future research needs are identified. Moreover, we represent a yet unexplored class of truck scheduling problems which is highly relevant in real-world distribution networks.

/pdf/cross-dock-scheduling-classification-literature-review-and-47bhci5mbp.pdf

Cross Dock Scheduling: Classification, Literature Review and Research Agenda

Computers in Operations Research.

This paper reviews the most relevant literature on efficient models and methods for packing circular objects/items into Euclidean plane regions where the objects/items and regions are either two- or three-dimensional. These packing problems are NP hard optimization problems with a wide variety of applications. They have been tackled using various approaches-based algorithms ranging from computer-aided optimality
proofs, to branch-and-bound procedures, to constructive approaches, to multi-start nonconvex minimization, to billiard simulation, to multiphase heuristics, and metaheuristics.

/pdf/a-literature-review-on-circle-and-sphere-packing-problems-nlg96o25d2.pdf

Rym M'Hallah

Papers

A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies

Heuristic algorithms for the two-stage hybrid flowshop problem

A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems

Minimizing total earliness and tardiness on a single machine using a hybrid heuristic

Approximate algorithms for constrained circular cutting problems