Transportation Science, Vol. 45, No. 2 (May 2011), pp. 175-198 (24 pages) The paper investigates train scheduling problems when prioritised trains and nonprioritised trains are simultaneously ...
We show that obtaining minimum finish time schedules with no wait in process is NP-Hard for flow shops, job shops and open shops. Specifically, it is shown that the two processor job and open shop ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback