高级算法 (Fall 2022)/Greedy and Local Search: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

19 November 2022

  • curprev 15:4515:45, 19 November 2022‎ Etone talk contribs‎ 33,826 bytes +33,826‎ Created page with "= Scheduling = We consider the following scheduling problem: * There are <math>n</math> '''jobs''' to be processed. * There are <math>m</math> identical parallel '''machines'''. Each machine can start processing jobs at time 0 and can process at most one job at a time. * Each job <math>j=1,2,\ldots, n</math> must be processed on one of these machines for <math>p_j</math> time units without interruption. <math>p_j</math> is called the '''processing time''' of job <math>j..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2022)/Greedy_and_Local_Search"