Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Online computation and competitive analysis
Online computation and competitive analysis
SIAM Journal on Discrete Mathematics
Supply chain scheduling: Batching and delivery
Operations Research
Online scheduling in a parallel batch processing system to minimize makespan using restarts
Theoretical Computer Science
On-line scheduling with delivery time on a single batch machine
Theoretical Computer Science
Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
Operations Research
Semi-online two-level supply chain scheduling problems
Journal of Scheduling
| Hi-index | 0.04 |
Suppose a distribution center receives orders from customers for delivery of some goods. Orders may be delayed to be grouped and delivered in batches. The cost of one delivery does not depend on the number of orders taken. The total cost (to be minimized) is the sum of the total delay time of the orders and the total delivery cost. In the on-line environment, where at any time there is no information about future orders, there is a simple on-line algorithm with competitive ratio 2 which is known to be the best possible. We consider the semi-online environment where at any instant we know the orders that will be released in the next S time units, but have no information about the orders that will be released later. For this environment, we present a semi-online algorithm and analyze its competitive ratio.