Motor Vehicle Accident Fatalities for the Week Ending, May 11, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, May 18, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, May 25, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, June 1, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, June 8, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, June 15, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Quarterly Report of the Building Project for the Motor Vehicle Division

Pursuant to Section 1 of House File 466 of the 81st General Assembly, the Iowa Department of Transportation is required to make quarterly reports to the Legislative Council regarding the progress of the building project for the Motor Vehicle Division. During the quarter ending June 30, 2007, the project was delayed by two weeks. The Motor Vehicle Division moved into the new Ankeny facility on June 22 and was operational Monday, June 25. The driver's license stations reopened as scheduled Tuesday, June 26, at the Ankeny facility as well as the Oliver Plaza renewal location.

Motor Vehicle Accident Fatalities for the Week Ending, June 29, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, June 22, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Motor Vehicle Accident Fatalities for the Week Ending, July 6, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, July 20, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, July 13, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, July 27, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.

Motor Vehicle Accident Fatalities for the Week Ending, August 3, 2007

Record of the Fatalities for Motor Vehicle Accidents in Iowa per week.