QUAY CRANE SCHEDULING PROBLEM IN PORT CONTAINER TERMINAL Wenjuan Zhao, Xiaolei Ma.

Slides:



Advertisements
Similar presentations
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Advertisements

Lecture 6: Job Shop Scheduling Introduction
Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
Linear Programming Models & Case Studies
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Transportation, Transshipment and Assignment Models and Assignment Models.
6-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Transportation, Transshipment, and Assignment Problems Chapter 6.
1 Inventory Control for Systems with Multiple Echelons.
Terminology Project: Combination of activities that have to be carried out in a certain order Activity: Anything that uses up time and resources CPM: „Critical.
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Linear Programming Example 5 Transportation Problem.
Berth and quay crane allocation as a scheduling problem J. Błażewicz, M. Machowiak Institute of Computing Science, Poznan University of Technology, C.
 1  Storage Space Allocation in Container Terminals Chuqian Zhang *1, Jiyin Liu *1, Yat-wah Wan *1, Katta G. Murty *2, Richard Linn *3 *1 IEEM, HKUST,
1 MAI Lab. Lot sizing and scheduling formulation in Single-level 발표자 : 정 현 종
1 IOE/MFG 543 Chapter 5: Parallel machine models (Sections )
Math443/543 Mathematical Modeling and Optimization
Computational Methods for Management and Economics Carla Gomes
ECE Synthesis & Verification - LP Scheduling 1 ECE 667 ECE 667 Synthesis and Verification of Digital Circuits Scheduling Algorithms Analytical approach.
Linear Programming Applications
Linear Programming Applications
Transportation Model (Powerco) Send electric power from power plants to cities where power is needed at minimum cost Transportation between supply and.
Decision for the location of Intermodal terminals in a rail-road network Anupam Kulshreshtha IIM - Lucknow.
A GAMS TUTORIAL. WHAT IS GAMS ? General Algebraic Modeling System Modeling linear, nonlinear and mixed integer optimization problems Useful with large,
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Network Models (2) Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
1 Chapter-4: Network Flow Modeling & Optimization Deep Medhi and Karthik Ramasamy August © D. Medhi & K. Ramasamy, 2007.
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Hungarian Algorithm Vida Movahedi Elderlab, York University June 2007.
1 Introduction to Linear and Nonlinear Programming.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Reverse Logistics Networks Steven Walker Logistic Systems: Design and Optimization (Chapter 6)
1 Project Planning, Scheduling and Control Project – a set of partially ordered, interrelated activities that must be completed to achieve a goal.
Hub Location Problems Chapter 12
Assembly Lines – Reliable Serial Systems
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Chapter 1. Formulations 1. Integer Programming  Mixed Integer Optimization Problem (or (Linear) Mixed Integer Program, MIP) min c’x + d’y Ax +
1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.
Scheduling. Definition of scheduling Establishing the timing of the use of equipment, facilities and human activities in an organization In the decision-making.
Two Discrete Optimization Problems Problem: The Transportation Problem.
Lecture 5 – Integration of Network Flow Programming Models Topics Min-cost flow problem (general model) Mathematical formulation and problem characteristics.
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
Slide 0 of 96 Manufacturing Facility Layout. Slide 1 of 96 Basic Layout Forms Process Product Cellular Fixed position Hybrid.
EMIS 8373: Integer Programming Mathematical Programming Example 5: Reallocating Students to Achieve Racial Balance updated 18 January 2005.
1 By: Prof. Y. Peter Chiu POM Chap-8: Scheduling ~ Homework Problems ~
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
Scheduling.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
Problems in Combinatorial Optimization. Linear Programming.
Balanced Billing Cycles and Vehicle Routing of Meter Readers by Chris Groër, Bruce Golden, Edward Wasil University of Maryland, College Park American University,
-114- HMP654/EXECMAS Linear Programming Linear programming is a mathematical technique that allows the decision maker to allocate scarce resources in such.
1 Introduction To Linear Programming l Today many of the resources needed as inputs to operations are in limited supply. l Operations managers must understand.
Chapter 3 Linear Programming Problems  Optimization problems whose objective functions and constraints are.  Optimization problems whose objective functions.
Linear Programming Applications
Solving IPs – Implicit Enumeration Similar to Binary IP Branch and Bound General Idea: Fixed variables – those for which a value has been fixed. Free Variable.
CHAPTER 8 Operations Scheduling
URBAN TRANSPORTATION NERWORKS
Load Balancing: List Scheduling
Spatial Forest Planning with Integer Programming
Transportation, Assignment and Network Models
Integer Programming (정수계획법)
Modeling Scheduling Problems
Project Presentation   For
Chapter 1. Formulations (BW)
Planning and Scheduling in Manufacturing and Services
Integer Programming (정수계획법)
Load Balancing: List Scheduling
Chapter 1. Formulations.
LTF: Functions vocabulary
Presentation transcript:

QUAY CRANE SCHEDULING PROBLEM IN PORT CONTAINER TERMINAL Wenjuan Zhao, Xiaolei Ma

What is QC Scheduling Problem  Determine the sequence of discharging and loading operations in a ship by each Quay Crane and the time schedule for the operation.

Major Input: Ship Stowage Plan Ship bay Deck Hold Hatch

Problem characteristics  Similar to m-parallel machine problem  Different from it with unique characteristics  Precedence relationships among tasks Tasks on deck and in hold from the same bay  Certain tasks cannot be performed simultaneously Cranes could not cross with each other

Problem inputs  Ship stowage plan (with all constraints)  Time required to carry each task  Crane travel time between different tasks  Crane ready time

Problem Notations  Indices Tasks to be performed QCs where  Problem Data The time required to perform task i The earliest available time of QC The location of task (expressed by the ship bay number) The starting position of QC The final position of QC k The travel time of a QC from location ( ) of task i to location ( ) of task j

Problem Notations  Sets of indices The set of all tasks The set of pairs of tasks not be performed simultaneously The set of ordered pairs of with precedence relationship  Decision variables 1 if crane k performs task j right after task i; 0 otherwise The completion time of QC k The completion time of task i 1 if task j starts later than the completion time of task i; 0 Time at which all tasks are completed

Problem Formulation Minimize Subject to: (1) Define makespan (2) Start from task 0 (3) End at task T (4) Each task assigned to one QC (5) Flow balance (7) Precedence constraint (6) Time constraint

Problem Formulation (8) Define Z ij (9) Non-simultaneous constraint (10) Non-interference (11) QC completion time (12) QC starting time (13) Binary variables (14) Non-negative

Reference: (1) Kim, K.H., Park, Y.M., A crane scheduling method for port container terminals. European Journal of Operation Research 156, 752–768. (2) Lee, D.H., Wang H.Q., Miao L.X., Quay crane scheduling with non-interference constraints in port container terminals. Transportation Research Part E 44, 124–135.