MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem (Q1694325): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2618401921 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57736442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description of 2-integer continuous knapsack polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting two-integer knapsack inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling cranes at an indented berth / 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: A generalized classification scheme for crane scheduling with interference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation by discretization: application to economic lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The berth allocation problem: models and solution methods / 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: A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time / 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: The berth planning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crane scheduling with spatial constraints / 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: An adaptive large neighborhood search for the discrete and continuous berth allocation problem / 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: A scheduling method for Berth and Quay cranes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal berth allocation and time-invariant quay crane assignment in container terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal policies for the berth allocation problem under stochastic nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tactical berth allocation under uncertainty / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:01, 15 July 2024

scientific article
Language Label Description Also known as
English
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
scientific article

    Statements

    MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem (English)
    0 references
    0 references
    0 references
    1 February 2018
    0 references
    berth allocation
    0 references
    quay crane scheduling
    0 references
    mixed integer formulations
    0 references
    branch and cut
    0 references
    rolling horizon heuristic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references