Aiming at the production scheduling problem in the hull block production, this study investigates the maximum use of the assembly blocks working platform. By transforming the scheduling problem into two-dimensional bin packing problem, this study explores the effective block spatial layout under the condition of spatial constraints. In order to improve the drawbacks of the lowest horizontal lin...

Global instruction scheduling allows operations to move across basic block boundaries to create tighter schedules. When operations move above control ow joins, some code duplication is generally necessary to preserve semantics. Tail duplication and compensation code are approaches to duplicating the necessary code, used by Superblock Scheduling and Trace Scheduling respectively. Compensation co...

menting other scheduling objectives, such as the minimization of buffering requirements, in a manner that is guaranteed not to interfere with code compaction goals. We have defined a class of SDF graphs called tightly interdependent graphs. Schedules for arbitrary SDF graphs can be constructed such that each block that is not contained in a tightly interdependent subgraph appears only once, and...

Over the past years, state-of-art power optimization methods move towards higher abstraction levels th a t result in more efficient power savings. Among existing power optimization approaches, dynamic power management (DPM) is considered to be one of the most effective strategies. Depending on abstraction levels, DPM can be implemented in different formats but here we focus on scheduling tha t ...

We consider an orthogonal frequency division multiple access (OFDMA) scheduling system. A scheduling unit block consists of contiguous multiple subcarriers. Users are scheduled based on their block average throughput in a proportional fair way. The multiuser diversity gain increases with the degree and dynamic range of channel fluctuations. However, a decrease of the block average throughput in...

Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to find a minimum length schedule for a basic block—a straight-line sequence of code with a single entry point and a single exit point—subject to precedence, latency, and resource constraints. Solving the problem exactly ...

A critical aspect of long-term open-pit mine planning consists in computing a production schedule based upon a block sequencing strategy. Such a schedule should specify when and if blocks should be extracted in such a way as to maximize NPV, while satisfying wall-slope and production capacity constraints. It is well known that this problem can be modeled with integer programming (IP). However, ...

In this paper the process of data transmission in optical communication networks is modeled as a shop-type scheduling problem, where channels (wavelengths) are treated as machines. We formulate an Open Block problem with the minimum makespan objective (an OB||Cmax problem) in which a relation of a new type between the operations of each job is introduced: any two operations of a job have identi...

This article is devoted to the run-time redistribution of one-dimensional arrays that are distributed in a block-cyclic fashion over a processor grid. In a previous paper 2], we have reported how to derive optimal schedules made up of successive communication-steps. In this paper we assume that successive steps may overlap. We show how to obtain an optimal scheduling for the most general case, ...

Special vehicles called transporters are used to deliver heavy blocks from one plant to another in shipyards. Because of the limitation on the number of transporters, the scheduling of transporters is important for maintaining the overall production schedule of the blocks. This paper considers a scheduling problem of block transportation under a delivery restriction to determine when and by whi...