Semi-online Early Work Maximization Problem on Two Hierarchical Machines with Partial Information of Processing Time

2021 ◽  
pp. 146-156
Author(s):  
Man Xiao ◽  
Xiaoqiao Liu ◽  
Weidong Li
Keyword(s):  
Processing Time ◽  
Partial Information ◽  
Maximization Problem ◽  
Hierarchical Machines

scholarly journals Semi-Online Scheduling on Two Machines withGoSLevels and Partial Information of Processing Time

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Taibo Luo ◽  
Yinfeng Xu
Keyword(s):  
Processing Time ◽  
Parallel Machines ◽  
Partial Information ◽  
Online Scheduling ◽  
Scheduling Problems ◽  
Total Processing Time ◽  
Grade Of Service ◽  
Two Machines

This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higherGoSlevel, knowing the total processing time of the jobs with lowerGoSlevel, or knowing both in advance. Respectively, for the three semi-online versions, we develop algorithms with competitive ratios of3/2,20/13, and4/3which are shown to be optimal.

scholarly journals Recursive Utility Maximization for Terminal Wealth under Partial Information

2016 ◽  
Vol 2016 ◽  
pp. 1-12
Author(s):  
Shaolin Ji ◽  
Xiaomin Shi
Keyword(s):  
Utility Maximization ◽  
Partial Information ◽  
Stochastic Game ◽  
Saddle Points ◽  
Game Problem ◽  
Maximization Problem ◽  
Recursive Utility ◽  
Terminal Wealth ◽  
Utility Maximization Problem ◽  
Recursive Utility Maximization

This paper concerns the recursive utility maximization problem for terminal wealth under partial information. We first transform our problem under partial information into the one under full information. When the generator of the recursive utility is concave, we adopt the variational formulation of the recursive utility which leads to a stochastic game problem and characterization of the saddle point of the game is obtained. Then, we study the K-ignorance case and explicit saddle points of several examples are obtained. At last, when the generator of the recursive utility is smooth, we employ the terminal perturbation method to characterize the optimal terminal wealth.

scholarly journals Online Parallel Machine Scheduling to Maximize the Number of Early Jobs

2012 ◽  
Vol 2012 ◽  
pp. 1-7
Author(s):  
Feifeng Zheng ◽  
Ming Liu ◽  
Chengbin Chu ◽  
Yinfeng Xu
Keyword(s):  
Completion Time ◽  
Processing Time ◽  
Arrival Time ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Time Algorithm ◽  
Maximization Problem ◽  
Due Date ◽  
Identical Machines ◽  
Over Time

We study a maximization problem: online scheduling onmidentical machines to maximize the number of early jobs. The problem is online in the sense that all jobs arrive over time. Each job's characteristics, such as processing time and due date, become known at its arrival time. We consider thepreemption-restart model, in which preemption is allowed, while once a job is restarted, it loses all the progress that has been made on this job so far. If in some schedule a job is completed before or at its due date, then it is calledearly(oron time). The objective is to maximize the number of early jobs. Formidentical machines, we prove an upper bound1-(1/2m)of competitive ratio and show thatECT(earliest completion time) algorithm is1/2-competitive.

A new tool for rapid development of electron microscopy negatives and micrographs: Initial impressions of the MOHR/PRO-8 processor

1992 ◽  
Vol 50 (2) ◽  
pp. 972-973
Author(s):  
James C. Long
Keyword(s):  
Electron Microscopy ◽  
Processing Time ◽  
Rapid Development ◽  
Processing Times ◽  
Initial Impressions ◽  
Transport Method

Over the years, many techniques and products have been developed to reduce the amount of time spent in a darkroom processing electron microscopy negatives and micrographs. One of the latest tools, effective in this effort, is the Mohr/Pro-8 film and rc paper processor.At the time of writing, a unit has been recently installed in the photographic facilities of the Electron Microscopy Center at Texas A&M University. It is being evaluated for use with TEM sheet film, SEM sheet film, 35mm roll film (B&W), and rc paper.Originally designed for use in the phototypesetting industry, this processor has only recently been introduced to the field of electron microscopy.The unit is a tabletop model, approximately 1.5 × 1.5 × 2.0 ft, and uses a roller transport method of processing. It has an adjustable processing time of 2 to 6.5 minutes, dry-to-dry. The installed unit has an extended processing switch, enabling processing times of 8 to 14 minutes to be selected.

Evidence for using partial information to reconstruct dates of events

1991 ◽  
Author(s):  
Charles P. Thompson ◽  
John J. Skowronski ◽  
Andrew L. Betz
Keyword(s):  
Partial Information

Classifying the Past: Discriminant Analysis and its Application to Medieval Farming Systems

1996 ◽  
Vol 8 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Ken Bartley
Keyword(s):  
Cluster Analysis ◽  
Discriminant Analysis ◽  
Processing Time ◽  
Farming Systems ◽  
Frame Of Reference ◽  
Analytical Models ◽  
Successful Implementation ◽  
Medieval Period ◽  
The Past ◽  
Livestock Management

This paper discusses the need for nationally based analytical models of the medieval period. The use of cluster analysis as a method for classifying demesne farms, by the crops they grew and their livestock management, is explained. Successful implementation of cluster analysis requires both the existence of a large base sample, to permit isolation of specific groupings within the data, and access to considerable processing time. The paper concludes by demonstrating how discriminant analysis can provide an efficient and systematic way of classifying even a single manor within a national frame of reference.

INFLUENCE OF FORCED CONVECTION IN LIQUID INSIDE THE TIN ON DURATION OF STERILIZATION IN THE COURSE OF FISH PROCESSING

2017 ◽  
pp. 137-144
Author(s):  
Gennadiy Valentinovich Alexeev ◽  
Elena Igorevna Verboloz
Keyword(s):  
High Temperature ◽  
Liquid Phase ◽  
Forced Convection ◽  
Thermal Process ◽  
Processing Time ◽  
Fish Processing ◽  
Study Results ◽  
Equipment Modernization ◽  
Bottom To Top

The article focuses on the process of intensive mixing of liquid phase in the tin during high-temperature sterilization, i.e. sterilization when temperature of the heat carrier reaches 150-160°C. It has been stated that for intensification of the thermal process during sterilization of tinned fish with liquid filling it is preferable to turn a tin from bottom to top. This operation helps to increase the driving power of the process and to shorten warming time. Besides, high-temperature sterilization carried out according to experimental modes, where the number of tin turnovers is calculated, greatly shortens processing time and improves quality of the product. In this case there is no superheating, all tins are evenly heated. The study results will contribute to equipment modernization and to preserving valuable food qualities.

Sign in / Sign up

Export Citation Format

Share Document