Secure & Prepared, July 5, 2006, Vol.2, no.13

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, July 25, 2006, Vol.2, no.14

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, August 6, 2006, Vol.2, no.15

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, August 22, 2006, Vol.2, no.16

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, September 5, 2006, Vol.2, no.17

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, September 19, 2006, Vol.2, no.18

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, October 4, 2006, Vol.2, no.19

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, October 31, 2006, Vol.2, no.21

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, October 17, 2006, Vol.2, no.20

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, November 28, 2006, Vol.2, no.22

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, December 12, 2006, Vol.2, no.23

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, January 10, 2007, Vol.3, no.1

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

Secure & Prepared, January 23, 2007, Vol.3, no.2

Secure & Prepared is a bi-weekly publication of the Iowa Homeland Security & Emergency Management Division for those involved in the homeland security system in the state of Iowa.

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.

Secure and Prepared Newsletter, August 7, 2007

Bi-monthly newsletter for those involved in the fields of homeland security and/or emergency management.