Routing and scheduling on a shoreline with release times

Article Abstract:

A class of 'shoreline' single-vehicle scheduling and routing problems with release time limitations is the center of research analyzing computational complexity issues. The research also suggests algorithms for the class of scheduling and routing problems which commonly occur in transportation environments. Research results indicate that for a straight-line case, the challenge of minimizing the maximum completion time can be resolved in quadratic time by using dynamic programming. Research results also indicate that for the shoreline case, heuristic algorithms are developed and a discussion of how they perform on practical data is included.

---

Some heuristics for scheduling jobs on parallel machines with setups

Article Abstract:

Three heuristics are studied to analyze the challenge of scheduling jobs on machines which are parallel and which have setup times. The specific issue examined is what setup times are incurred when a machine changes from processing one kind of job for another kind of job. The goal is to determine a workable plan for each machine which achieves total rewards for each machine. Empirical findings and results of the heuristics are discussed.

---

Similar abstracts:

• Abstracts: Algorithms for scheduling a single machine to minimize the weighted number of late jobs. A Lagrangean based branch and bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time
• Abstracts: Information cost and innovation adoption policies. Towards a heuristic theory of problem structuring
• Abstracts: A heuristic scheduling policy for multi-item, single-machine production systems with time-varying, stochastic demands. part 2
• Abstracts: The new financial instruments. GASB's future role
• Abstracts: Planning quality cost expenditures. Running actual costs vs. standard costs. A government cost control program for private industry

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.