 This is a more complex problem than "job shop scheduling" because after completion of one work-step, the system has to assign an available machine for the next type of operation until all operations for a given production order are completed.Regardless of the type of scheduling problem the algorithm needed to accomplish this task has n!complexity (n factorial).