The aim of this paper is to solve a problem on scheduling with earliness and tardiness costs using constraint programming approach, and to compare the results with the ones from the original timed automata approach. The case study, a production of lacquers, includes some real life features like operating hours or changeover times. Considering the earliness and tardiness costs of the case study,...

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...

A novel algorithm for one machine scheduling to minimize total weighted earliness and tardiness using particle swarm optimization is proposed. Existing techniques face challenges such as job size limitations increase in computational time and inaccurate solutions. To overcome these challenges the proposed work implements Meta-Heuristic based particle swarm optimization to optimize the total wei...

The family scheduling problems involve multiple job types where jobs are classified into specific families by their similarity characteristics. Within this class of problems, the single machine family scheduling problem to minimize total tardiness is at least binary NP-Hard. In this paper, we consider the case where jobs in the same family need not be processed together and develop a hybrid gen...

This paper studied the flow shop scheduling problem under machine availability constraints. The machines are subject to flexible preventive maintenance activities. The nonresumable scenario for the jobs was considered. That is, when a job is interrupted by an unavailability period of a machine it should be restarted from the beginning. The objective is to minimize the total tardiness time for t...

We consider single machine scheduling problems with a non-renewable resource. This type of problems has not been intensively investigated in the literature so far. For several problems of this type with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity results. Particu...

The purpose of this paper is to propose a new branch-and-bound algorithm for a class of scheduling problems to minimize total tardiness on identical parallel machines. In this algorithm, Lagrangian relaxation technique is applied to obtain a tight lower bound. In addition, the job dominance conditions for the single machine total tardiness problem are utilized for both restricting branches and ...

Parallel machines concept is a well-known and widely used system in the manufacturing facilities. Scheduling of these parallel machines has been a key activity in the successful product outcome. Though jobs are executed on schedules, in certain cases the completion time increases resulting in tardiness. This survey work identifies and compiles the optimization strategies and solution approaches...

This paper describes a genetic algorithm approach to the dynamic job shop scheduling problem with jobs arriving continually. Both deterministic and stochastic models of the dynamic problem were investigated. The objective functions examined were weighted flow time, maximum tardiness, weighted tardiness, weighted lateness, weighted number of tardy jobs, and weighted earliness plus weighted tardi...

This paper is concerned with scheduling robotic flexible assembly cells (RFACs) using fuzzy logic (FL) technique. A new scheduling rule is developed and evaluated called fuzzy sequencing rule (FSR). A simulation program is used to examine the performance of the existing scheduling rules and the proposed rule with respect to multiple performance measures. Four performance measures considered sim...