Sequential operations on the same machine
Fig 2. Sequential operations on the same machine
Sequential operations on the same machine
The above figure shows an example of two operations q and j of two different jobs p and i, being sequentially scheduled for one machine, machine k. In this general case job i operation j (ij) cannot begin on this machine until job p operation q (pq) is complete.
As for Figure 1, we can formally describe this from an integer programming point of view by stating that:
... which enforces the sequentiality.
Within the constraints that machine k belongs to a set of machines, whose size is m:
... and the jobs both i and p, belong to a set of n jobs:
This gives the overall, formal expression:
Contact the EDC
For further details of the EDC's activities please get in touch with us through our contact page.
Commercial Research at Newcastle University
A full list of commercially available research facilities for Newcastle University can be found on the Services for Business web pages.
