Scheduling jobs within time windows on identical parallel machines: new model and algorithms

Article Abstract:

A model is developed for scheduling non-preemptive jobs performed within time windows on identical parallel machines. The model considers two situations wherein jobs have to be completed at fixed start and end times and when jobs can be completed within a time window longer than its processing time. An added constraint is that jobs can only be performed on a sub-set of machines. The model is also applied on scheduling for low-orbit Earth sensing satellites.

---

Generalized pairwise interchanges and machine scheduling

Article Abstract:

Generalized pairwise interchanges (GPI) for single- and multi-machine scheduling problems are developed. The processes included under GPI are Adjacent and Non-Adjacent Pairwise Interchanges and Extraction and Forward/Backward Shifted Reinsertions. GPI operators were used to calculate lower bounds for single-machine problems, prove dominance properties and determine a strong neighborhood for local search methods.

Branch and bound algorithms

---

FUN: a dynamic method for scheduling problems

Article Abstract:

A dynamic method for the solution of shop scheduling problems based on fuzzy rules is developed. The FUzzy-Neuro (FUN) method uses a neuro-fuzzy based allocation system that adapts to changes that occur in a shop. Application of FUN in a back propagation network provides solutions in real time. FUN can also function as a static method or a combination of both static and dynamic parts.

Set theory, Fuzzy sets

Similar abstracts:

• Abstracts: Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• Abstracts: Backtracking of jobs in one-dimensional machine location problems. Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy
• Abstracts: A dynamic lot sizing model with exponential machine breakdowns. A buffer minimization problem for the design of embedded systems
• Abstracts: Heuristics for scheduling a single machine subject to unequal job release times. Multi-level, single-machine lot sizing and scheduling (with initial inventory)
• Abstracts: Obstacles to reforming the UN: interests of developed and developing countries clash. Is UN declaration universal?

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