Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
From MaRDI portal
Publication:6164375
DOI10.1016/J.COR.2023.106174MaRDI QIDQ6164375FDOQ6164375
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)
production schedulingberth allocationintegrated approachmetaheuristic approachmaritime bulk terminalstorage yard allocation
Cites Work
- Job-shop scheduling with limited capacity buffers
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Berth allocation with time-dependent physical limitations on vessels
- A set-partitioning-based model for the berth allocation problem under time-dependent limitations
- Title not available (Why is that?)
- A block approach for single-machine scheduling with release dates and due dates
- An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- A flexible job shop scheduling approach with operators for coal export terminals
- A grasp for job shop scheduling
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem
- Novel formulations and modeling enhancements for the dynamic berth allocation problem
- Mathematical models for the berth allocation problem in dry bulk terminals
- A research survey: review of flexible job shop scheduling techniques
- Handbook of metaheuristics
- Operations research at bulk terminal: a parallel column generation approach
- Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
- A flexible job shop scheduling approach with operators for coal export terminals -- a mature approach
- Real-time production scheduling in the Industry-4.0 context: addressing uncertainties in job arrivals and machine breakdowns
- Stockpile scheduling with geometry constraints in dry bulk terminals
- A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem
- Berth assignment for liner carrier clusters under a cooperative environment
Cited In (2)
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)
