Tightening methods for continuous-time mixed-integer programming models for chemical production scheduling

AIChE Journal ◽  
2013 ◽  
Vol 59 (12) ◽  
pp. 4461-4467 ◽  
Author(s):  
Andres F. Merchan ◽  
Sara Velez ◽  
Christos T. Maravelias
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Continuous Time ◽  
Production Scheduling ◽  
Programming Models ◽  
Mixed Integer ◽  
Chemical Production

Mixed Integer Programming Models on Scheduling Automated Stacking Cranes

2021 ◽  
Vol 8 (4) ◽  
pp. 11-33
Author(s):  
Amir Gharehgozli ◽  
Orkideh Gharehgozli ◽  
Kunpeng Li
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Recent Trend ◽  
Container Terminals ◽  
Programming Models ◽  
Mixed Integer ◽  
Global Supply Chains ◽  
Objective Functions ◽  
Operational Constraints ◽  
Automated Stacking Cranes

Automated deep-sea container terminals are the main hubs to move millions of containers in today's global supply chains. Terminal operators often decouple the landside and waterside operations by stacking containers in stacks perpendicular to the quay. Traditionally, a single automated stacking cranes (ASC) is deployed at each stack to handle containers. A recent trend is to use new configurations with more than one crane to improve efficiency. A variety of new configurations have been implemented, such as twin, double, and triple ASCs. In this paper, the authors explore and review the mixed integer programming models that have been developed for the stacking operations of these new configurations. They further discuss how these models can be extended to contemplate diverse operational constraints including precedence constraints, interference constraints, and other objective functions.

Sign in / Sign up

Export Citation Format

Share Document