Ten notes on equal-processing-time scheduling
- 202 Downloads
Equal-processing-time scheduling problems whose complexity status has been unknown are shown to be solved in polynomial time by well-known and relatively new techniques. Single-machine, parallel-machine, parallel-batch, open-shop, flow-shop and job-shop environments are touched upon.
Keywords:Scheduling computational complexity polynomial time
Unable to display preview. Download preview PDF.