A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem

DOI10.1016/j.ejor.2018.11.033zbMath1430.90261arXiv1702.05603OpenAlexW2900595178WikidataQ128942652 ScholiaQ128942652MaRDI QIDQ1711458

Martín Gómez Ravetti, Gabriela B. Fonseca, Thiago Henrique Nogueira

Publication date: 18 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.05603

zbMATH Keywords

Lagrangian relaxationlogisticscross-dockingtruck scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Stream data load prediction for resource scaling using online support vector regression ⋮ Lagrangian relaxation algorithm for the truck scheduling problem with products time window constraint in multi-door cross-dock ⋮ Cross-docking based factory logistics unitisation process: an approximate dynamic programming approach ⋮ A genetic algorithm to minimize the makespan in a two-machine cross-docking flow shop problem ⋮ Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors

Uses Software

• SPOT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling cross docking operations under full, partial and no information on inbound arrivals
• Facility location models for distribution system design
• Truck scheduling at zero-inventory cross docking terminals
• Truck dock assignment problem with operational time constraint within crossdocks
• Minimizing makespan in two-stage hybrid cross docking scheduling problem
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
• The volume algorithm revisited: relation with bundle methods
• The volume algorithm: Producing primal solutions with a subgradient method
• Scheduling inbound and outbound trucks at cross docking terminals
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• Multiple crossdocks with inventory and time windows
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
• Vehicle routing with cross-docking
• The Effects of Trailer Scheduling on the Layout of Freight Terminals
• Parallel Metaheuristics
• Scheduling
• Computational combinatorial optimization. Optimal of probably near-optimal solutions

This page was built for publication: A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem