Maneesh Sahani Due: Thu Dec 10, 2015 Note:all assignments for this course are to be handed in to the Gatsby Unit, not to the CS department. Please give all assignments to the lecturer or TAs at the beginning of lecture on or before the due date. Alternatively, your may bring coursework to Mr. Barry Fong at the Gatsby Unit reception. This is a combined assignment worth 150 marks (plus bonuses). ...

Learning theory from the ‘behaviorist’ camp suggests that a stimulus (problem) with quick feedback and then repetition (resubmission) will increase student learning. To test this assumption an experiment was conducted. In an introductory management information system class students are given the opportunity to submit several skill-building assignments prior to the due date. These submissions we...

We present a novel model for due date quotation. Jobs arrive at a single server over time. Upon arrival, the processing time of each job is known, and due dates must be quoted for each job. The jobs must be sequenced on the server so that all jobs complete processing at or before their due dates, and the sum of quoted due dates is minimized. We develop several variations of an on-line heuristic...

We consider the single-machine problem of scheduling n jobs to minimize the total weighted deviation from a given common due date, where the weights for early and tardy completion are asymmetric. First, we assume that the common due date is large. We formulate this problem as an integer linear program with an exponential number of variables and present a column generation algorithm to solve e c...

Project expediting is often viewed as a corrective action taken in response to prior scheduling errors and is usually applied in the later stages of projects when it appears that predefined due dates will not be met. However, large-scale projects with uncertain activity durations tend to have numerous probabilistic network paths with complex interactions that require some level of expediting to...

WC consider the nonprccmptivc single machine scheduling problem with multiple due-dates (delivery dates). where the time between two consecutive due-dates is a constant. Given a set of jobs, we are interested in scheduling the jobs such that the sum of the total due-date cost and the total earliness cost is minimized with the constraint that each job must be finished at or before its due-date. ...