A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
From MaRDI portal
Publication:1751727
DOI10.1016/j.ejor.2016.08.073zbMath1394.90293OpenAlexW2518515647MaRDI QIDQ1751727
Martín Gómez Ravetti, Gustavo Campos Menezes, Geraldo Robson Mateus
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.08.073
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (8)
Stockpile scheduling with geometry constraints in dry bulk terminals ⋮ Tug scheduling for hinterland barge transport: a branch-and-price approach ⋮ A multi‐period integrated planning and scheduling approach for developing energy systems ⋮ Scheduling wagons to unload in bulk cargo ports with uncertain processing times ⋮ Storage Yard Management: Modelling and Solving ⋮ Scheduling reclaimer operations in the stockyard to minimize makespan ⋮ Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system ⋮ A flexible job shop scheduling approach with operators for coal export terminals -- a mature approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust bunker management for liner shipping networks
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- Scheduling at coal handling facilities using simulated annealing
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
- Models and heuristic algorithms for a weighted vertex coloring problem
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- A cutting plane approach for integrated planning and scheduling
- Branching rules revisited
- A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Integrated Charge Batching and Casting Width Selection at Baosteel
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An Improved Formulation for the Job-Shop Scheduling Problem
- New methods to color the vertices of a graph
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
This page was built for publication: A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
