نتایج جستجو برای: coordinated quay crane scheduling and assignment problem

تعداد نتایج: 16932438  

Journal: :Mathematics 2022

With the trend of terminal automation and requirement for port operation efficiency to be greatly improved, it is very necessary optimize traveling route automatic guided vehicles (AGV) with reference connection loading unloading equipment. As a complex multi-equipment system, inevitable that AGV will collide when due various accidents in actual operation, which lead locking reduce operation. C...

2014
Ankush Goel Sandeep Kumar Yamuna Nagar

This paper provides an overview of Resource Scheduling in Distributed System. Grid computing is an important and developing computing initiative that involves the aggregation of network connected computers to form a large-scale, distributed system for coordinated problem solving and resource scheduling. The primary concern associated with the grid computing is efficient management of resources,...

2014
Cunchang Gu Xiaoyan Xu

The coordination of production scheduling and transportation has recently received a lot of attention in logistics and supply chain management. We study a coordinated scheduling problem, in which each job is transported to a single serial batching machine for further processing, each batch to be processed occurs a processing cost, and the objective is minimizing the sum of the makespan and the ...

2014
Nitish UMANG

In the operations research (OR) literature on port operations planning, there are a significant number of studies addressing decision problems in the context of container terminal management. Bulk terminals on the other hand, have been largely ignored. In this thesis, we study some of the key decision problems such as the berth allocation problem and the yard assignment problem in the bulk cont...

2007
WOJCIECH BLAJER KRZYSZTOF KOŁODZIEJCZYK W. BLAJER K. KOŁODZIEJCZYK

Abstract. Manipulating payloads with cranes can be challenging due to undesirable load pendulations induced by the crane motion and external perturbations. The problem gets increasingly difficult when the work environment is cluttered with obstacles. Automatic control schemes offer a high potential of rationalization. In this paper a methodology of constructing appropriate load trajectories all...

Journal: :international journal of optimaization in civil engineering 0
a. kaveh y. vazirinia

tower cranes are major and expensive equipment that are extensively used at building construction projects and harbors for lifting heavy objects to demand points. the tower crane locating problem to position a tower crane and supply points in a building construction site for supplying all requests in minimum time, has been raised from more than twenty years ago. this problem has already been so...

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...

Journal: :Applied Artificial Intelligence 2022

With the regular development of global epidemic, port shipping supply is tight. The problem congestion, soaring freight rates, and hard-to-find container space has emerged. This paper proposes a new joint berth-quay crane allocation model, namely E-B&QC, by taking minimum time in ship, cost extra transportation distance for collector trucks land area port, waiting ships. Then, deficiencies spar...

Journal: :4OR 2010
Dirk Briskorn Andreas Drexl Frits C. R. Spieksma

Scheduling a sports league can be seen as a difficult combinatorial optimization problem. We study some variants of round robin tournaments and analyze the relationship with the planar three-index assignment problem. The complexity of scheduling a minimum cost round robin tournament is established by a reduction from the planar three-index assignment problem. Furthermore, we introduce integer p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید