Abstract
The shop-scheduling problem with two jobs andm machines is considered under the condition that the machine order is fixed in advance for the first job and nonfixed for the second job. The problems of makespan and mean flow time minimization are proved to be NP-hard if operation preemption is forbidden. In the case of preemption allowance for any given regular criterion theO(n *) algorithm is proposed. Here,n * is the maximum number of operations per job.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have