scholarly journals A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

2003 ◽  
Vol 49 (9) ◽  
pp. 1268-1273 ◽  
Author(s):  
Keely L. Croxton ◽  
Bernard Gendron ◽  
Thomas L. Magnanti
2021 ◽  
Vol 8 (4) ◽  
pp. 11-33
Author(s):  
Amir Gharehgozli ◽  
Orkideh Gharehgozli ◽  
Kunpeng Li

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.


1974 ◽  
Vol 3 (2) ◽  
pp. 103-113 ◽  
Author(s):  
J. M. Gates ◽  
V. J. Norton ◽  
J. J. Mueller

The disposal of industrial and municipal wastes is a complex and costly problem. The combination of increases in population, affluence, and industrial activity is generating growing volumes of water borne waste that must be disposed of or recycled. In 1972 for example, the estimated volume of wastewater generated in Rhode Island was 179 million gallons per day (MGD). This represented an average of 185 gallons per day for each Rhode Island resident and indications are that this volume is increasing each year.


2009 ◽  
Vol 3 (2) ◽  
pp. 15-35 ◽  
Author(s):  
Waldemar Kaczmarczyk

This paper presents new mixed integer programming models for the Proportional Lot-Sizing Problem (PLSP) with set-up times longer than a period. Proposed models explicitly calculate the distribution of times amongst products in periods with a changeover and determine a final period for every set-up operation. Presented results prove that the proposed models are easier to solve using standard MIP methods than already known models.


Sign in / Sign up

Export Citation Format

Share Document