Minimizing Total Weighted Tardiness on Parallel Batch-Processing Machine Scheduling Problems with Varying Machine Capacities

2011 ◽  
Vol 110-116 ◽  
pp. 3906-3913 ◽  
Author(s):  
Fuh Der Chou ◽  
Hui Mei Wang
Keyword(s):  
Heuristic Algorithms ◽  
Batch Processing ◽  
Total Weighted Tardiness ◽  
Mixed Integer ◽  
Due Dates ◽  
Weighted Tardiness ◽  
Processing Machine ◽  
Release Times ◽  
Mip Model ◽  
Batch Processing Machine

This paper extends the study of Mathirajan et al. (Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates. Int. J. Adv. Manuf. Technol., 2010, doi: 10.1007/s00170-009-2342-y) to parallel batch-processing machine problems because these have not been examined to date. For the problem concerning compatible product families, job release times, non-identical job sizes, and varying machine capacities, we propose a mixed integer programming (MIP) model, and a number of simple dispatch-based heuristic and simulated annealing (SA) algorithms. Computational results revealed that the proposed SA is capable of obtaining similar solutions acquired by MIP within a short time. The SA algorithms outperform other heuristic algorithms with respect to solution quality.

Single Batch-Processing Machine Scheduling Problem with Fuzzy Due-Dates

2016 ◽  
pp. 751-769 ◽  
Author(s):  
Sadegh Niroomand ◽  
Ali Mahmoodirad ◽  
Saber Molla-Alizadeh-Zavardehi
Keyword(s):  
Programming Model ◽  
Batch Processing ◽  
Total Weighted Tardiness ◽  
Mixed Integer ◽  
Test Problems ◽  
Due Date ◽  
Processing Machine ◽  
Batch Processing Machine ◽  
Scale Test ◽  
Single Batch

This paper focuses on a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in existence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS) and simulated annealing (SA) frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms.

scholarly journals Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
S. Molla-Alizadeh-Zavardehi ◽  
R. Tavakkoli-Moghaddam ◽  
F. Hosseinzadeh Lotfi
Keyword(s):  
Batch Processing ◽  
Total Weighted Tardiness ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Test Problems ◽  
Hybrid Metaheuristics ◽  
Due Date ◽  
Processing Machine ◽  
Batch Processing Machine ◽  
Single Batch

This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS), and simulated annealing (SA) frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms.

scholarly journals Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost

2020 ◽  
Vol 90 (9) ◽  
pp. 1345-1381
Author(s):  
Jens Rocholl ◽  
Lars Mönch ◽  
John Fowler
Keyword(s):  
Genetic Algorithms ◽  
Pareto Front ◽  
Total Weighted Tardiness ◽  
Mixed Integer ◽  
Due Dates ◽  
Semiconductor Wafer ◽  
Weighted Tardiness ◽  
Electricity Cost ◽  
Problem Instances ◽  
Special Case

Abstract A bi-criteria scheduling problem for parallel identical batch processing machines in semiconductor wafer fabrication facilities is studied. Only jobs belonging to the same family can be batched together. The performance measures are the total weighted tardiness and the electricity cost where a time-of-use (TOU) tariff is assumed. Unequal ready times of the jobs and non-identical job sizes are considered. A mixed integer linear program (MILP) is formulated. We analyze the special case where all jobs have the same size, all due dates are zero, and the jobs are available at time zero. Properties of Pareto-optimal schedules for this special case are stated. They lead to a more tractable MILP. We design three heuristics based on grouping genetic algorithms that are embedded into a non-dominated sorting genetic algorithm II framework. Three solution representations are studied that allow for choosing start times of the batches to take into account the energy consumption. We discuss a heuristic that improves a given near-to-optimal Pareto front. Computational experiments are conducted based on randomly generated problem instances. The $$ \varepsilon $$ ε -constraint method is used for both MILP formulations to determine the true Pareto front. For large-sized problem instances, we apply the genetic algorithms (GAs). Some of the GAs provide high-quality solutions.

Sign in / Sign up

Export Citation Format

Share Document