[PDF] Top 20 Preemptive scheduling on uniform parallel machines with controllable job processing times

... crashed job k = π(u) with the largest compression ...the processing time of job k ∈ N (u ; 1, g) grows, the structure of the corresponding schedule may change, and the situation that such a change ... See full document

... of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to ... See full document

... the scheduling batch processing machines in parallel to minimize total ...unequal job ready times, arbitrary job sizes, and arbitrary job processing ... See full document

... of scheduling jobs uniform parallel ma- chines to minimize the sum of earliness and tardiness ...Any job completion beyond its due date results in earli- ness or tardiness penalty, which may ... See full document

... semi-on-line scheduling n jobs on m identical parallel machines under the assumption that the ordering of the jobs by processing time is known and the jobs have arbitrary release ... See full document

... the processing time, machine idle time is also another important element in deciding the quality of the ...25 machines, 100 problem instances were ...The processing times were drawn randomly ... See full document

... several scheduling problems, in which it is required to minimize the total penalty for choosing actual processing times, also known as total compression ...several parallel machines, so ... See full document

... the parallel identical machines problem when the due date is a decision ...in job schedules. Cheng and Chen [4] have extended the study of the parallel machine case by showing that the problem ... See full document

... m uniform processors with the objective of reducing the ...(longest processing time first) schedules are within twice the length of the opti- mum makespan ...1.4 times of the optimum ...(longest ... See full document

... of scheduling parallel machine with sequence dependent set up ...identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time ... See full document

... a job and the number of the machine selected for its ...the job being assigned to the corresponding machine and 0 means that a job is not assigned to that ...and machines assigned to each ... See full document

... any job can be completed by time d if it is processed by the fastest machine, any pair of jobs can be completed by d if they are processed on the two fastest machines, ...fastest machines, and ... See full document

... first job assigned in phase h + 1 ...of machines with finishing time big- ger than 2 Γ * h by the end of phase ...any job J u ∈ L h the following inequalities hold ... See full document

... completed scheduling regenerates a completely new schedule for all the unprocessed ...completed scheduling may construct a better solution in theory, it is rarely applied in practice due to high computation ... See full document

... In this paper, on-line scheduling problem for jobs with arbitrary release times on uniform machines is considered. We developed an algorithm with the competi- tive ratio of 7.4641 which is ... See full document

... deterministic Job Shop Scheduling Problems (DJSSP) where each job’s processing time is specific and known in advance have attracted considerable attention for several years ...fixed processing ... See full document

... as parallel batch-processing machines problems with incompatible job families where clean time is needed when successive dishes with different recipes cook at the same pot, and the objective ... See full document

... EDF scheduling of sporadic task systems,” proposes a limited-preemption scheduling technique will be presented to join the benefits of both preemptive and non-preemptive ...for ... See full document

... The complexity of the mathematical programming model developed for this problem hasn’t permitted to find one solution using optimising methods and so the authors have developed a heuristic based on the simulated ... See full document

... algorithms Preemptive and Non preemptive with parameters waiting time and turnaround ...for preemptive scheduling is ...non preemptive scheduling is ... See full document