A train scheduling problem in a single-track railway is studied using a mixed graph model for a job-shop with appropriate criteria. There are several performance evaluations for a train schedule. Optimizing a train schedule subtends minimizing total tardiness of the trains, minimizing the sum of train transit times, minimizing the makespan for a train schedule, etc. Since the corresponding job-...

In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...

The task of job shop scheduling – determining the sequence and timing of jobs on available resources – is one of the most discussed practical problems in operations management. There are many appropriate problem definitions for job shop scheduling due to the complex and dynamic nature of the problem with a large number of variables and constraints linked to jobs and resources, such as specific ...

One of the basic and significant problems, that a shop or a factory manager is encountered, is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is job shop scheduling. There are different machines in a shop of which a job may require some or all these machines in some specific sequence. For solving this problem, the objective may be to minimize the makesp...

Abstract In order to solve the problems such as poor diversity and convergence ability of offspring population NSGA-II Algorithm in vehicle production scheduling problem, an improved shop algorithm based on is proposed. The NSGA-ii mainly focuses crossover mutation traditional Algorithm, proposes a new self-adaptive Crossover operator. By comparing individual crowding degree with average popula...

A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...