Tardiness Scheduling with Fuzzy Processing Time Using Tabu Search

2012 ◽  
Vol 472-475 ◽  
pp. 2279-2282
Author(s):  
Hong Bing Yang ◽  
Wen Chao Li ◽  
Xian Ping Guan ◽  
Fei Zhou
Keyword(s):  
Tabu Search ◽  
Parallel Machines ◽  
Programming Model ◽  
Fuzzy Theory ◽  
Difficult Problem ◽  
Total Tardiness ◽  
Mixed Integer ◽  
Processing Times ◽  
Fuzzy Processing Times ◽  
Parallel Machines Scheduling

In this paper, we address unrelated parallel machines scheduling problem with fuzzy processing times considering the minimization of the total tardiness cost. The tardiness credibility index of jobs is given to estimate the possibility of job’s tardiness, and a mixed integer programming model (MIP) is formulated for total tardiness cost based on fuzzy theory. Solving the MIP problem is NP-hard, thus a tabu search is designed to solve such a difficult problem. The results of computational test show the feasibility and effectiveness of the developed model and algorithm.

scholarly journals Fuzzy Scheduling Problem on Unrelated Parallel Machine in JIT Production System

2020 ◽  
pp. 17-33
Author(s):  
Javad Rezaeian ◽  
Samir Mohammad-Hosseini ◽  
Sara Zabihzadeh ◽  
Keyvan Shokoufi
Keyword(s):  
Parallel Machines ◽  
Programming Model ◽  
Statistical Tests ◽  
Setup Times ◽  
Scheduling Problem ◽  
Due Dates ◽  
Processing Times ◽  
Fuzzy Environment ◽  
Parallel Machines Scheduling ◽  
Dependent Setup Times

This paper deals with unrelated parallel machines scheduling problem with sequence dependent setup times under fully fuzzy environment to minimize total weighted fuzzy earliness and tardiness penalties, which belongs to NP-hard class. Due to inherent uncertainty in Processing times, setup times and due dates of jobs, they are considered here with triangular and trapezoidal fuzzy numbers in order to take into account the unpredictability of parameters in practical settings. Although this study is not the first one to study on fuzzy parallel machines scheduling problem, it advances this area of research in three fields: (1) it selects a fuzzy environment to cover the whole area of the considered problem not just part of it, and also, it chooses an appropriate fuzzy method based on an in-depth investigation of the effect of spread of fuzziness on the variables; (2) It introduces a mathematical programming model for the addressed problem as an exact method; and (3) due to NP-hardness of the problem, it develops an existing algorithm in the literature for the considered problem through extensive simulated experiments and statistical tests on the same benchmark problem test by proposing a genetic algorithm (GA) and a modified simulated annealing (SA) methods to solve this hard combinatorial optimization problem. The result shows the superiority of our modified SA.

Single machine earliness/tardiness scheduling problem with grey processing times and the grey common due date

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Oğuzhan Ahmet Arık
Keyword(s):  
Programming Model ◽  
Heuristic Method ◽  
Mixed Integer ◽  
Grey Theory ◽  
Scheduling Problem ◽  
Due Date ◽  
Content Type ◽  
Common Due Date ◽  
Processing Times ◽  
Uncertainty Of Parameters

PurposeThis paper presents a mixed-integer programming model for a single machine earliness/tardiness scheduling problem where the objective is to minimize total earliness/tardiness duration when the uncertainty of parameters such as processing times and due date is coded with grey numbers.Design/methodology/approachGrey theory and grey numbers are used for illustrating the uncertainty of parameters in processing times and common due date, where the objective is to minimize the total earliness/tardiness duration. The paper proposes a 0–1 mathematical model for the problem and an effective heuristic method for the problem by using expected processing times for ordering jobs.FindingsThe uncertainty of the processing times and common due date are encoded with grey numbers and a position-dependent mixed-integer mathematical programming model is proposed for the problem in order to minimize total grey earliness/tardiness duration of jobs having grey processing times and a common due date. By using expected processing times for ranking grey processing times, V-shaped property of the problem and an efficient heuristic method for the problem are proposed. Solutions obtained from the heuristic method show that the heuristic is effective. The experimental study also reveals that while differences between upper and lower bounds of grey processing times decrease, the proposed heuristic's performance decreases.Originality/valueThe grey theory and grey numbers have been rarely used as machine scheduling problems. Therefore, this study provides an important contribution to the literature.

A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD

2009 ◽  
Vol 26 (06) ◽  
pp. 817-829 ◽  
Author(s):  
XIAOFENG HU ◽  
JINGSONG BAO ◽  
YE JIN
Keyword(s):  
Tabu Search ◽  
Parallel Machines ◽  
Search Algorithm ◽  
Real Data ◽  
Total Tardiness ◽  
Tabu Search Algorithm ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Pipe Processing ◽  
Flowshop Scheduling Problem

This paper focuses on scheduling problem of a pipe-processing flowshop in a shipyard. The flowshop composes of five stages, including cutting, bending, welding preprocessing, argon-welding and CO 2-welding, and each stage consists of identical parallel machines. Since thousands of pipes are mounted on the hull block before erection, the pipe-processing scheduling is a critical task for shipbuilding to meet the due date of the block erection. A tabu search algorithm is developed for the scheduling problem with the objective of minimizing total tardiness. Computational experiments are performed on the collected real data. Results show that the proposed algorithm is efficient for this problem.

scholarly journals Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

2012 ◽  
Vol 2012 ◽  
pp. 1-20 ◽  
Author(s):  
Wenming Cheng ◽  
Peng Guo ◽  
Zeqiang Zhang ◽  
Ming Zeng ◽  
Jian Liang
Keyword(s):  
Variable Neighborhood Search ◽  
Parallel Machines ◽  
Programming Model ◽  
Search Algorithm ◽  
Optimal Schedule ◽  
Deteriorating Jobs ◽  
Mixed Integer ◽  
Computational Time ◽  
Neighborhood Search ◽  
Scheduling Problem

In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight-combination search algorithm and a variable neighborhood search are employed to yield optimal or near-optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time even for large-sized problems.

scholarly journals Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times

2021 ◽  
Author(s):  
Hanane Krim ◽  
Nicolas Zufferey ◽  
Jean-Yves Potvin ◽  
Rachid Benmansour ◽  
David Duvivier
Keyword(s):  
Tabu Search ◽  
Parallel Machines ◽  
Mixed Integer ◽  
Weighted Sum ◽  
Scheduling Problem ◽  
Maintenance Policy ◽  
Mixed Integer Linear Program ◽  
Job Rejection ◽  
Completion Times ◽  
Sum Of Completion Times

AbstractWe consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.

Sign in / Sign up

Export Citation Format

Share Document