Delivery Times for Cesarean Section at Queen Elizabeth Central Hospital, Blantyre, Malawi: Is a 30-minute ???Informed to Start of Operative Delivery Time??? Achievable?

2004 ◽  
Vol 59 (1) ◽  
pp. 11-13
Author(s):  
M. O???Regan
Keyword(s):  
Cesarean Section ◽  
Operative Delivery ◽  
Delivery Time ◽  
Central Hospital ◽  
Delivery Times ◽  
Queen Elizabeth Central Hospital

scholarly journals Early doxorubicin cardiotoxicity in Malawian children admitted to Queen Elizabeth Central Hospital, Malawi

2021 ◽  
Author(s):  
Dominic Moyo ◽  
Yamikani Chimalizeni ◽  
George Chagaluka ◽  
Clifford G. Banda ◽  
Elizabeth M. Molyneux
Keyword(s):  
Central Hospital ◽  
Doxorubicin Cardiotoxicity ◽  
Queen Elizabeth Central Hospital

scholarly journals Associative Factors for Birth Asphyxia at Queen Elizabeth Central Hospital—Malawi

2017 ◽  
Vol 05 (05) ◽  
pp. 22-31 ◽  
Author(s):  
Edith Tewesa ◽  
Ellen Chirwa ◽  
Maureen Daisy Majamanda ◽  
Alfred Maluwa ◽  
Angela Chimwaza
Keyword(s):  
Birth Asphyxia ◽  
Central Hospital ◽  
Queen Elizabeth Central Hospital

scholarly journals 3/2-approximation algorithm for a single machine scheduling problem

2021 ◽  
Vol 17 (3) ◽  
pp. 240-253
Author(s):  
Natalia S. Grigoreva ◽  
Keyword(s):  
Approximation Algorithm ◽  
Optimization Problem ◽  
Single Machine Scheduling ◽  
Release Time ◽  
Scheduling Problem ◽  
Delivery Time ◽  
Scheduling Problems ◽  
Delivery Times ◽  
Jobshop Scheduling ◽  
Single Processor

The problem of minimizing the maximum delivery times while scheduling tasks on a single processor is a classical combinatorial optimization problem. Each task ui must be processed without interruption for t(ui) time units on the machine, which can process at most one task at time. Each task uw; has a release time r(ui), when the task is ready for processing, and a delivery time g(ui). Its delivery begins immediately after processing has been completed. The objective is to minimize the time, by which all jobs are delivered. In the Graham notation this problem is denoted by 1|rj,qi|Cmax, it has many applications and it is NP-hard in a strong sense. The problem is useful in solving owshop and jobshop scheduling problems. The goal of this article is to propose a new 3/2-approximation algorithm, which runs in O(n log n) times for scheduling problem 1|rj.qi|Cmax. An example is provided which shows that the bound of 3/2 is accurate. To compare the effectiveness of proposed algorithms, random generated problems of up to 5000 tasks were tested.

Histological Phenotype of Breast Cancer in Indigenous Malawian Women Presenting at Queen Elizabeth Central Hospital in Malawi

2017 ◽  
Vol 06 (01) ◽  
Author(s):  
Nelson Chimbiya ◽  
Clemence Marimo ◽  
Trevor Kaile ◽  
Tamiwe Tomoka ◽  
Steve Kamiza ◽  
...  
Keyword(s):  
Breast Cancer ◽  
Central Hospital ◽  
Histological Phenotype ◽  
Queen Elizabeth Central Hospital
Sign in / Sign up

Export Citation Format

Share Document