New integer programming models for tactical and strategicunderground production scheduling

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.

Download Full-text

Integer programming models for logical layout design of modular machining lines

Computers & Industrial Engineering ◽

10.1016/j.cie.2006.08.010 ◽

2006 ◽

Vol 51 (3) ◽

pp. 502-518 ◽

Cited By ~ 34

Author(s):

Sana Belmokhtar ◽

Alexandre Dolgui ◽

Nikolai Guschinsky ◽

Genrikh Levin

Keyword(s):

Integer Programming ◽

Layout Design ◽

Programming Models ◽

Machining Lines

Download Full-text

Solving Spreadsheet-Based Integer Programming Models: An Example from International Telecommunications

Decision Sciences ◽

10.1111/j.1540-5915.1990.tb01251.x ◽

1990 ◽

Vol 21 (4) ◽

pp. 808-824 ◽

Cited By ~ 2

Author(s):

Robert L. Carraway ◽

J. Michael Cummins ◽

James R. Freeland

Keyword(s):

Integer Programming ◽

Programming Models ◽

International Telecommunications

Download Full-text

The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-319-07959-2_2 ◽

2014 ◽

pp. 10-21 ◽

Cited By ~ 8

Author(s):

Péter Biró ◽

David F. Manlove ◽

Iain McBride

Keyword(s):

Integer Programming ◽

Programming Models

Download Full-text

Transportation with volume discount: a case study of a logistic operator in Ghana

Journal of Transport Literature ◽

10.1590/s2238-10312014000200002 ◽

2014 ◽

Vol 8 (2) ◽

pp. 7-37

Author(s):

Abdul-Salam Sibidoo Mubashiru

Keyword(s):

Integer Programming ◽

Production Scheduling ◽

Transportation Problem ◽

Transportation Network ◽

Supply And Demand ◽

Network Models ◽

Cost Effective ◽

Capital Budgeting ◽

Integer Programming Problems ◽

Optimality Algorithm

Network models and integer programming are well known variety of decision making problems. A very useful and widespread area of application is the management and efficient use of scarce resources to increase productivity. These applications include operational problems such as the distributions of goods, production scheduling and machine sequencing, and planning problems such as capital budgeting facility allocation, portfolio selection, and design problems such as telecommunication and transportation network design. The transportation problem, which is one of network integer programming problems is a problem that deals with distributing any commodity from any group of 'sources' to any group of destinations or 'sinks' in the most cost effective way with a given 'supply' and 'demand' constraints. Depending on the nature of the cost function, the transportation problem can be categorized into linear and nonlinear transportation problem. We applied Karush-Kuhn-Tucker (KKT) optimality algorithm to solve our problem of transportation with volume discount for a logistic operator in Ghana.

Download Full-text