Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem

DOI10.1016/J.COR.2023.106174MaRDI QIDQ6164375zbMATH OpenFDO

Authors Nicolas Cheimanoff, Pierre Féniès, Mohamed Nour Kitri, Nikolay Tchernev

Publication date 4 July 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2023.106174

zbMATH Keywords

production schedulingberth allocationintegrated approachmetaheuristic approachmaritime bulk terminalstorage yard allocation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
• A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
• Modelling and metaheuristic for gantry crane scheduling and storage space allocation problem in railway container terminals

Cites work

• scientific article; zbMATH DE number 1516979 (Why is no real title available?)
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• A block approach for single-machine scheduling with release dates and due dates
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• A flexible job shop scheduling approach with operators for coal export terminals
• A flexible job shop scheduling approach with operators for coal export terminals -- a mature approach
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A generalized permutation approach to job shop scheduling with genetic algorithms
• A grasp for job shop scheduling
• A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A research survey: review of flexible job shop scheduling techniques
• A set-partitioning-based model for the berth allocation problem under time-dependent limitations
• A survey of berth allocation and quay crane scheduling problems in container terminals
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
• Berth allocation with time-dependent physical limitations on vessels
• Berth assignment for liner carrier clusters under a cooperative environment
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems
• Greedy randomized adaptive search procedures
• Handbook of metaheuristics
• Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
• Job-shop scheduling with limited capacity buffers
• Mathematical models for the berth allocation problem in dry bulk terminals
• Metaheuristic algorithms for the hybrid flowshop scheduling problem
• Novel formulations and modeling enhancements for the dynamic berth allocation problem
• Operations research at bulk terminal: a parallel column generation approach
• Real-time production scheduling in the Industry-4.0 context: addressing uncertainties in job arrivals and machine breakdowns
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Stockpile scheduling with geometry constraints in dry bulk terminals

Cited in

(5)

• An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
• Operations research, machine learning, and integrated techniques for decision problems in the Seaside area of container terminals
• Formulations and heuristic for the long-term preventive maintenance order scheduling problem
• An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model
• A review of bulk terminal operations: status, trends, and future outlook

This page was built for publication: Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem

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