Resource constrained scheduling problems with general truncated sum-of-processing time dependent effect under single machine and unrelated parallel machines

2017 ◽  
Vol 110 ◽  
pp. 344-352 ◽  
Author(s):  
Xingong Zhang ◽  
Win-Chin Lin ◽  
Chou-Jung Hsu ◽  
Chin-Chia Wu
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Parallel Machines ◽  
Time Dependent ◽  
Unrelated Parallel Machines ◽  
Scheduling Problems ◽  
Resource Constrained ◽  
Dependent Effect ◽  
Time Dependent Effect

A robust multi-response VNS-aiNet approach for solving scheduling problems under unrelated parallel machines environments

2021 ◽  
pp. 115140
Author(s):  
Rodney Oliveira Marinho Diana ◽  
Sérgio Ricardo de Souza ◽  
Elizabeth Fialho Wanner
Keyword(s):  
Parallel Machines ◽  
Unrelated Parallel Machines ◽  
Scheduling Problems

Time-dependent effect of an oral hypoglycemic agent upon serum glucose levels

1973 ◽  
Vol 10 (4) ◽  
pp. 841-851
Author(s):  
Juan J. Gagliardino ◽  
María T. Pessacq ◽  
Oscar Marcote ◽  
Elma E. Gagliardino
Keyword(s):  
Serum Glucose ◽  
Time Dependent ◽  
Oral Hypoglycemic Agent ◽  
Dependent Effect ◽  
Glucose Levels ◽  
Hypoglycemic Agent ◽  
Time Dependent Effect

A Risk-Adapted Strategy of Adjuvant Paclitaxel/Carboplatin in Early-Stage Ovarian Cancer: Time-Dependent Effect of 4 versus 6 Cycles on Outcome

Oncology ◽  
2011 ◽  
Vol 81 (5-6) ◽  
pp. 365-371 ◽  
Author(s):  
Aristotle Bamias ◽  
Christina Bamia ◽  
Alexandra Karadimou ◽  
Nikolaos Soupos ◽  
Flora Zagouri ◽  
...  
Keyword(s):  
Ovarian Cancer ◽  
Early Stage ◽  
Time Dependent ◽  
Dependent Effect ◽  
Time Dependent Effect ◽  
Early Stage Ovarian Cancer

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.

Sign in / Sign up

Export Citation Format

Share Document