๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On minimizing resource consumption with constraints on the makespan and the total completion time

โœ Scribed by Stanislav H. Vasilev; Bob L. Foote

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
524 KB
Volume
96
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

โœฆ Synopsis

We investigate a single machine scheduling problem where the resource consumed depends on the release times of jobs. The objective is to minimize the total consumption subject to a constraint on the makespan or the total completion time.

Results by Li are extended to the case where the consumption function is convex decreasing. A further extension to multiple consumption functions is shown. Conditions for feasibility are developed in each case.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing the makespan on a single mach
Minimizing the makespan on a single machine with learning and unequal release times
โœ Chin-Chia Wu; Chin-Liang Liu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

The importance of the ready times can be found in Wafer fabrication with the presence of unequal ready times. It is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. On th

Rendezvous search on the line with bound
Rendezvous search on the line with bounded resources: expected time minimization
โœ Steve Alpern; Anatole Beck ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 692 KB

Two players are placed on the line and want to meet. Neither knows the direction of the other, but they know the distance between them or perhaps the distribution of this distance. They can move with speed at most one, and each has a 'resource constraint' on the total distance he can travel. We firs