Learn More
The single-machine early/tardy (E/T) scheduling problem is addressed in this research. The objective of this problem is to minimize the total amount of earliness and tardiness. Earliness and tardiness are weighted equally and the due date is common and large (unrestricted) for all jobs. Machine setup time is included and is considered sequence-dependent.(More)
We summarize our methodology for modeling space shuttle processing using discrete event simulation. Why the project was initiated, what the overall goals were, how it was funded, and who were the members of the project team are identified. We describe the flow of the space shuttle flight hardware through the supporting infrastructure and how the model was(More)
In this paper, a Branch-and-Bound (B&B) algorithm is presented to solve the problem of minimizing the maximum completion time C max on unrelated parallel machines with machine eligibility restrictions when job preemption is not allowed. A customized lower bound, a search and a branching strategy are developed for the B&B. A machine eligibility factor is(More)