The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...

This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...

The Group Shop Scheduling Problem (GSP) is a generalization of the classical Job Shop and Open Shop Scheduling Problems. In the GSP there are m machines and n jobs. Each job consists of a set of operations, which must be processed on specified machines without preemption. The operations of each job are partitioned into groups on which a total precedence order is given. The problem is to order t...

In this paper novel hybrid genetic algorithms for Open--Shop Scheduling Problem (OSSP) are presented. Two greedy heuristics LPT-Task and LPT-Machine are proposed for decoding chromosomes represented by permutations with repetitions. For comparison the standard permutation representation of OSSP instances is used. The algorithms apply also efficient crossover operator LOX and mutation operators ...

Process scheduling is a classical problem in the field of production planning and control; in particular, effective job shop scheduling remains an essential component in today’s highly dynamic and agile production environment. This paper presents unified framework for solving generic job shop scheduling problems based on the formulation of a job shop into three main classes of problem, namely, ...

This paper considers a scheduling problem in which a single operator completes a set of n jobs requiring operations on two machines. The operator can perform only one operation at a time, so when one machine is in use the other is idle. After developing general properties of optimal schedules, the paper develops e cient algorithms for minimizing maximum lateness. The algorithm has time complexi...

In the last decade job shop scheduling problems have been subject to intensive research due to their multiple applications. Job shop scheduling is known as a strongly NPcomplete problem. In the job shop scheduling problems, processing times and due dates are very dynamically due to both human and machine resource factors. Fuzzy sets are used to model the uncertain processing times and due dates...

The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. Th...