• No results found

maximum completion time

Multiservice Product Comparison System

Multiservice Product Comparison System

... minimum completion time by optimizing the basic bandwidth allocation, r, among LSBT ...the maximum completion time D for propagating a data ...

6

JOB-SHOP SCHEDULING OPTIMIZATION WITH STOCHASTIC PROCESSING TIMES

JOB-SHOP SCHEDULING OPTIMIZATION WITH STOCHASTIC PROCESSING TIMES

... The mission of the scheduling process is to optimally allocate the suitable equipment to perform the required jobs over a period to achieve the business goals. Therefore, many efforts have been devoted to solve most ...

11

Scheduling partially ordered jobs faster than 2n

Scheduling partially ordered jobs faster than 2n

... processing time t (v) ∈ [0, +∞ ). For a job v, its completion time is the total amount of time that this job waited to be finished; formally, the completion time of a job v is ...

25

Designing a Multi-Objective Mathematical Model for Flexible Job Shop Scheduling Problem With the Earliness/Tardiness Penalty

Designing a Multi-Objective Mathematical Model for Flexible Job Shop Scheduling Problem With the Earliness/Tardiness Penalty

... -objective optimization algorithms have been used to solve the model. Kaplanoğlu (2016), presented an Object-Oriented approach to the multi-objective FJSP. In this research, an O-O approach for multi- objective FJSP with ...

8

Study of Task Scheduling Algorithms in the          Cloud Computing Environment: A Review

Study of Task Scheduling Algorithms in the Cloud Computing Environment: A Review

... minimum completion time for that ...in completion time of task and consequently makespan also increases But does not consider load of the machines before ...expected completion ...

7

Experimental-based simulated annealing for job shop scheduling problems with stochastic processing times

Experimental-based simulated annealing for job shop scheduling problems with stochastic processing times

... at time zero and the objective function is to optimize some characteristics of the random makespan (the maximum completion time which is equivalent to the completion time of the ...

44

On predicting time to completion for the first stage of spontaneous labor at term in multiparous women

On predicting time to completion for the first stage of spontaneous labor at term in multiparous women

... predicting time to completion of active labor and beginning of the second stage with pushing and imminent ...conditional time for a woman with 1 previous birth and 6-cm cervical dilation is 53 min ...

8

Online Full Text

Online Full Text

... Abstract—When designing an interface component (i.e button) for mobile device, many designers tend to use proportional approach against the screen size. They do not consider the ergonomic factor of the users’ hand ...

5

Cloud Computing Based on Load Balancing

Cloud Computing Based on Load Balancing

... In this Round Robin algorithm, fixed quantum of time is given to the job. Round Robin is used for network communication. It allocates jobs to all nodes in a circular motion. Processors are assigned in a circular ...

5

Completion Time in a Metagraph with Fuzzy Duration for Edges

Completion Time in a Metagraph with Fuzzy Duration for Edges

... Completion time of stochastic metagraphs by sampling from edge time and using the conditional Monte-Carlo simulation have been developed in ...

6

Towards Time Aware Knowledge Graph Completion

Towards Time Aware Knowledge Graph Completion

... Knowledge Graph Completion. Nickel et al. (2016) provide a broad overview of machine learning models for KG completion. These models predict new facts in a given knowledge graph using informa- tion from ...

10

Binary Choice Health State Valuation and Mode of Administration: Head-to-Head Comparison of Online and CAPI

Binary Choice Health State Valuation and Mode of Administration: Head-to-Head Comparison of Online and CAPI

... the time trade-off (TTO) preference elicitation technique [1] and six- dimensional health state short form (derived from SF-36) using the standard gamble (SG) approach ...

11

Analysing BitTorrent's seeding strategies

Analysing BitTorrent's seeding strategies

... this time point, peers become leechers or if some peers already have the complete set of pieces when they join, they become initial seeds (we do not consider this case in our ...

10

Improving the palbimm scheduling algorithm for fault tolerance in cloud computing

Improving the palbimm scheduling algorithm for fault tolerance in cloud computing

... T oday, the use of information and communication technologies has substantially increased in human life. One of the latest technologies in this field is cloud computing with a variety of applications in the majority of ...

6

Completion Time Dynamics For Masters And Doctoral Studies At Makerere University

Completion Time Dynamics For Masters And Doctoral Studies At Makerere University

... The following three diagnostic tests were performed. First, the global and detailed proportionality tests of the hazards were satisfied (p > 0.05). In doing so, the model was stratified by the year of commencement ...

8

Smartphones as prospective memory aids after traumatic brain injury : a dissertation presented in partial fulfilment of the requirements of the degree of Doctor of Clinical Psychology at Massey University, Wellington, New Zealand

Smartphones as prospective memory aids after traumatic brain injury : a dissertation presented in partial fulfilment of the requirements of the degree of Doctor of Clinical Psychology at Massey University, Wellington, New Zealand

... could be upgraded to 32Gb. It had a 600MHz central processing unit and 512MP RAM, running on Li-ion 1500mAH battery with a reported 5 hour talk time and up to 450 hours standby. This model is Wi-Fi capable and has ...

310

Biomimicry of Learning Complex Movements by Coordination of Simple Least-Effort Parts.

Biomimicry of Learning Complex Movements by Coordination of Simple Least-Effort Parts.

... that completion time has on path selection, the same Level 3 movements are used to create similar Level 4 movements, but with ten second completion times instead of ...The time lapse for Path ...

45

OCTAL: Optimal Completion of gene trees in polynomial time

OCTAL: Optimal Completion of gene trees in polynomial time

... Optimal Completion problem, which seeks a com- pletion of the input gene tree with respect to a given ref- erence tree that minimizes the RF distance between the two ...Optimal Completion of Incomplete gene ...

18

Usability Testing on Android Application of Infrastructure and Facility Reporting Management Information System

Usability Testing on Android Application of Infrastructure and Facility Reporting Management Information System

... Based on those issues, this study is focused on doing usability testing that involves respondents from students, lecturers and staffs of Faculty of Computer Science Brawijaya University by giving them several task ...

10

Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor

Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor

... performance of an algorithm A via worst-case competitive analysis: A is r-competitive if for all request sequences σ we have α A (σ ) ≤ rα ∗ (σ) where α ∗ (σ) is the value of an optimum offline schedule for σ . Now we ...

31

Show all 10000 documents...

Related subjects