The complexity of a cyclic scheduling problem with identical machines and precedence constraints

Article Abstract:

A cyclic scheduling problem for a set T of tasks with unit processing times is analyzed. Each task must be done infinitely often and there is a uniform constraint between two tasks which causes a set of precedence constraints on their successive executions. The problem is limited to the case where each execution of T must end by a special task f, and uniform constraints between executions from different iterations begin from f. The goal is to look for a periodic schedule of T which optimizes the throughput. Findings reveal that the problem is NP-hard and is polynomial for two machines.

Methods, Mathematical optimization, Optimization theory

---

Job-shop scheduling: computational study of local search and large-step optimization methods

Article Abstract:

Local search and large-step optimization techniques are analyzed for the solution of the job-shop scheduling problem. Local optimization methods are used to derive a two-phase large-step optimization scheme. The method involves a large optimized transition from the current solution and the use of a local search method. Sample applications show that large-step optimization techniques provide optimal schedules and perform better than the simulated annealing approach.

Machine-shop practice, Machine shop practice

---

Similar abstracts:

• Abstracts: Heuristic for unrelated machine scheduling with precedence constraints. Insertion of a random task in a schedule: a real time approach
• Abstracts: A dynamic lot sizing model with exponential machine breakdowns. A buffer minimization problem for the design of embedded systems
• Abstracts: Scheduling jobs within time windows on identical parallel machines: new model and algorithms. FUN: a dynamic method for scheduling problems

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