A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886847473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast heuristic for quay crane scheduling with interference constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of berth allocation and quay crane scheduling problems in container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crane scheduling problem: models and solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling by Logic-Based Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A crane scheduling method for port container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crane scheduling with spatial constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yard crane scheduling in port container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the quay crane scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations research at container terminals: a literature update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solution of the joint quay crane and truck scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transshipment of containers at a container terminal: An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crane scheduling with non-crossing constraint / rank
 
Normal rank

Revision as of 10:08, 17 July 2024

scientific article
Language Label Description Also known as
English
A Benders decomposition-based framework for solving quay crane scheduling problems
scientific article

    Statements

    A Benders decomposition-based framework for solving quay crane scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2018
    0 references
    OR in maritime industry
    0 references
    container terminal
    0 references
    quay crane scheduling
    0 references
    logic-based Benders decomposition
    0 references
    0 references

    Identifiers