An exact and heuristic approach for single machine scheduling problem
This paper proposes an exact approach and various heuristics including initial solution, beam search, and improvement search heuristic to solve the single machine scheduling problem. The study presents computational results for cost lower bounds for a partial schedule.
- Uploaded on | 0 Views
-
nelsonjensen
About An exact and heuristic approach for single machine scheduling problem
PowerPoint presentation about 'An exact and heuristic approach for single machine scheduling problem'. This presentation describes the topic on This paper proposes an exact approach and various heuristics including initial solution, beam search, and improvement search heuristic to solve the single machine scheduling problem. The study presents computational results for cost lower bounds for a partial schedule.. The key topics included in this slideshow are single machine scheduling, cost lower bounds, initial solution, beam search, improvement search heuristic,. Download this presentation absolutely free.
