earliness and tardiness
Electromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and tardiness
... In this paper, we study a flow shop batch processing machines scheduling problem. The fuzzy due dates are considered to make the problem more close to the reality. The objective function is taken as the weighted sum of ...
12
Minimizing Total Weighted Earliness and Tardiness for Parallel Batch processing Machines with Incompatible Job Families
... batches v, v+1 is different. Constraints (14) force the start time for the first batch to being processed on machine k to zero. Constraints (15) formulate the completion time of batch v be greater than or equal to the ...
5
A Scheduling Model of Flexible Manufacturing System to Reduce Waste and Earliness/Tardiness Penalties
... penalized earliness and tardiness in a flexible manufacturing ...job tardiness, and minimum mean machine idle time, ...mean tardiness, work-in-process inventory, production rate and other ...
9
Bounds for the Permutation Flowshop Scheduling Problem with Exact Time Lags while Minimizing the Total Earliness and Tardiness
... Furthermore, variety of flowshop problems with tar- diness earliness-based objective are adressed in the lit- erature. The no-wait permutation flow shop scheduling (F |N o W ait| P T + E) problem is studied by ...
6
Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness
... Common due dates is pioneered by many researches e.g. Kanet [11], and Baker and Scudder [12] where two kinds of due dates are defined: the unrestrictive one if its optimal value has no influence on the optimal sequence ...
11
Improving effectiveness of parallel machine scheduling with earliness and tardiness costs: A case study Pages 375-392 Download PDF
... delay cost per job is 7.7 times greater than the storage cost. In this context, analyzing several scenarios with different cost proportions can be used to see the effects of the proposed approach in other companies. ...
18
A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
... The pairs of constraints (3), (16) and (4), (15) assure the proper minimization of the earliness and tardiness and constraint (2) reflects the earliness and tardiness for each job with respect ...
19
Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process Pages 321-336 Download PDF
... The tardiness and earliness of each job are calculated by Constraints (4) and ...of earliness and tardiness in the first component of objective function and related constraints (4) and ...
16
Designing a Multi-Objective Mathematical Model for Flexible Job Shop Scheduling Problem With the Earliness/Tardiness Penalty
... of earliness, like tardiness, can be ...the earliness and tardiness penalties in the objective function can partly reduce these ...the earliness and tardiness of the production ...
8
Single-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
... To implement genetic algorithm, the first step is to write the specific properties of the solution in the form of a chromosome string. Each chromosome is made of a combination of genes and certain alphabet. This ...
9
Mathematical models for a batch scheduling problem to minimize earliness and tardiness
... are then used to form batches and finally, batches are sequenced optimally. Zhao, Hu and Li (2006) investigated properties of an optimal schedule for a batch scheduling problem with the assumptions of a common due ...
16
An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
... In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed ...
16
Particle swarm optimization for minimizing total earliness/tardiness costs of two-stage assembly flowshop scheduling problem in a batched delivery system
... In this problem, n single-item products are manufactured that each is made by assembling several different parts. The parts are produced in a flow-shop at the first stage consisting m-1 parallel machines and then an ...
14
Bi-level Model for Reliability based Maintenance and Job Scheduling
... Relation (1) shows the objective function of upper level. The first component calculates the total weighted earliness and tardiness cost. The second component computes the interruption cost. Equality (2) ...
8
Multi-criteria sequence-dependent single machine scheduling using genetic and simulated annealing algorithms
... The single machine scheduling problem (SMSP) has been extensively investigated during the last decades [1]. Most of the contributions consider a single optimization criterion, although in practice the Decision Maker ...
6
Fuzzy Simulation based Genetic Algorithm for Just in Time Flow Shop Scheduling with Linear Deterioration Function
... This paper considers a flow shop scheduling problem with earliness and tardiness penalties simultaneously that known as just-in-time problem. In classical flow shop scheduling problems, job processing times ...
8
A genetic algorithm for generalized tardiness flowshop problems
... total earliness and tardiness of the test ...total tardiness minimization in a flowshop with multiple processors at each ...maximum earliness and the total tardiness of scheduling the ...
10
A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
... Scheduling problem is the allocation of resources to perform a set of activities in a certain period of time [1]. Job shop scheduling problem (JSSP) is one of the most complicated combinatorial optimizations. JSSP may be ...
12
A Mathematical Model of a Multi-Criteria Parallel Machine Scheduling Problem: a Genetic Algorithm (RESEARCH NOTE)
... In this paper, we consider N jobs on a number of unrelated parallel machines selected from a set of M potential machines so as to minimize the sum of earliness and tardiness penalties as well as machine ...
8
A genetic algorithm for preemptive scheduling of a single machine Pages 607-614 Download PDF
... an earliness-tardiness single machine n job scheduling model where idle times was allowed and the earliness and tardiness penalties were proportional to the processing times of the ...of ...
8