This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

One of the basic and significant problems that a shop or a factory manager encounters is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is just-in-time scheduling. Motivated by just-intime manufacturing, we consider the multi-objective problem. These objectives minimize total weighted tardiness, earliness and minimize total flow time with fuzzy paramete...

| Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the underlying computation work. RIPS utilizes the advanced parallel scheduling technique to produce a low-overhead, high-quality load balancing, as well as adapting to irregular applications. This paper ...

We consider the problem of minimizing the makespan when scheduling tasks on two uniform parallel machines, where one machine is q times as efficient on each task as is the other. We compute the maximum relative error of the LPT (largest processing time first) heuristic as a function of q. In the special case that the two machines are identical (q = 1), our problem and heuristic are identical to...

In this article, a specific production scheduling problem (PSP), the Parallel Machine Scheduling Problem (PMSP) with Job and Sequence Setup Times, Due Dates Maintenance Times is presented. article after introduction literature review mathematical model of Machines After that Monte Carlo Tree Search Simulated Annealing are detailed. Our representation technique its evaluation also introduced. th...

This paper investigates the scheduling problem of dealing with disruption caused by machine breakdown under the environment of identical parallel machines. When a machine breakdown changes the scheduling environment, the original schedule cannot be executed according to the prescribed plan. The objective after disruption is to create a recovery schedule that minimizes the original objective fun...

A new Lagrangian relaxation (LR) approach is developed for job shop scheduling problems. In the approach, operation precedence constraints rather than machine capacity constraints are relaxed. The relaxed problem is decomposed into single or parallel machine scheduling subproblems. These subproblems, which are NP-complete in general, are approximately solved by using fast heuristic algorithms. ...

In this paper, we describe adaptation techniques for a hierarchically organized multi-agent-system (MAS) applied to production control of complex job shops. The system architecture of the production control system is based on three different control layers. The mid layer implements a distributed shifting bottleneck type solution procedure. The shifting bottleneck heuristic decomposes the overal...