Results 1  10
of
13
A Survey of Scheduling Problems with Setup Times or Costs
"... 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 mid1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setu ..."
Abstract

Cited by 104 (5 self)
 Add to MetaCart
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 mid1960s. 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. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and nonbatching considerations, and with sequenceindependent and sequencedependent setup times. It further categorizes the literature according to shop environments, including singlemachine, parallel machines, flow shop, nowait flow shop, flexible flow shop, job shop, open shop, and others.
A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times
 Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008
"... In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous work and propose a new neighborhood structure for this problem which is based on reversing operations on a critical pa ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous work and propose a new neighborhood structure for this problem which is based on reversing operations on a critical path. We have conducted an experimental study across the conventional benchmarks and some new ones of larger size. The results of these experiments show clearly that our approach outperforms the current stateoftheart methods.
A survey of genetic algorithms for shop scheduling problems
 in: P. Siarry: Heuristics: Theory and Applications, Nova Science Publishers
, 2013
"... Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on a set of machines such that a specific optimization criterion is satisfied. According to the restrictions on the technological routes of the jobs, we distinguish a flow shop (each job is characterized by the same technological route), a job shop (each job has a specific route) and an open shop (no technological route is imposed on the jobs). We also consider some extensions of shop scheduling problems such as hybrid or flexible shops (at each processing stage, we may have a set of parallel machines) or the inclusion of additional processing constraints such as controllable processing times, release times, setup times or the nowait condition. After giving an introduction into basic genetic algorithms dis
JobShop Scheduling Problem With Sequence Dependent Setup Times
"... Abstract — The majority of researches on scheduling assume setup times negligible or as a part of the processing time. In this paper, job shop scheduling with sequence dependent setup times is considered. After defining the problem, a mathematical model is developed. Implementing the mathematical mo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract — The majority of researches on scheduling assume setup times negligible or as a part of the processing time. In this paper, job shop scheduling with sequence dependent setup times is considered. After defining the problem, a mathematical model is developed. Implementing the mathematical model in large problems presents a weak performance to find the optimum results in reasonable computational times. Although the proposed mathematical model presents a good performance to obtain feasible solutions, it is unable to reach the optimum results in larger problems. Thus, a heuristic model based on priority rules is developed. Because of the inability to find optimum solutions in reasonable computational times, 3 different innovative lower bounds are developed, which could be implemented to evaluate different heuristics and metaheuristics in large problems. The performance of the heuristic model evaluated with a wellknown example in the literature insures that the model seems to have a strong ability to solve jobshop scheduling with sequence dependent setup times problems and to obtain good solutions in reasonable computational times. Keywords: Jobshop scheduling, Heuristic model, , Priority rules, Mathematical model
Achieving of Tabu Search Algorithm for Scheduling Techniques in Grid Computing Using GridSim Simulation Tool
 Multiple Jobs on Limited Resource”, International Journal of Grid and Distributed Computing
, 2010
"... Grid computing is a form of distributed computing involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographically dispersed organization. One of the scheduling techniques in Grid Computing is Tabu Search algorithm. A good scheduling algor ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Grid computing is a form of distributed computing involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographically dispersed organization. One of the scheduling techniques in Grid Computing is Tabu Search algorithm. A good scheduling algorithm is normally shows lower value of total tardiness and schedule time. The implementation Tabu Search algorithm was tested and evaluated on universal datasets using GridSim tool. The results indicate performance of tardiness is directly related to number of machines up to certain number of resources. Small and medium company can use grid in operation process because it saves cost and times.
A New Multiobjective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
"... chi ve of S ID ..."
(Show Context)
SequenceDependent Setup Times in a TwoMachine JobShop with Minimizing the Schedule Length
, 2006
"... AbstractThis article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup times and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may ..."
Abstract
 Add to MetaCart
(Show Context)
AbstractThis article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup times and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially solvable via Jackson's permutations, otherwise it is NPhard even if each of n jobs consists of one operation on the same machine. We present sufficient conditions when Jackson’s permutations may be used for solving the twomachine jobshop problem with sequencedependent setup times and removal times. For the general case of this problem, the results obtained provide polynomial lower and upper bounds for the makespan which are used in a branchandbound algorithm. Computational experiments show that an exact solution for this problem may be obtained in a suitable time for n ≤ 280. We also develop a heuristic algorithm and present a worst case analysis. KeywordsScheduling theory, Setup, Jobshop 1.
CENTRALIZED VERSUS MARKETBASED APPROACHES TO MOBILE TASK ALLOCATION PROBLEM: STATEOFTHE
"... Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many reallife applications. On the other hand, marketbased approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existenc ..."
Abstract
 Add to MetaCart
Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many reallife applications. On the other hand, marketbased approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existence of some efforts to review the pros and cons of each approach in RAPs, the studies cannot be directly applied to specific problem domains like mobile task allocation problem which is characterised with high level of uncertainty on the availability of resources (workers). This paper aims to review existing studies on task allocation problems(TAPs) focusing on those two approaches and their comparison and identify major issues that need to be resolved for comparing the two approaches in mobile task allocation problems. Mobile Task Allocation Problem (MTAP) is defined and its problematic structures are explained in relation with task allocation to mobile workers. Solutions produced by each approach to some applications and variations of MTAP are also discussed and compared. Finally, some future research directions are identified in order to compare both approaches in function of uncertainty emerging from the mobile nature of the MTAP. I.
Optimization of Scheduling Problems: A genetic algorithm survey 1
"... Abstract: There are various methods to optimize the scheduling systems such as tabu search, genetic algorithms and simulated annealing etc. These methods usually require much less work than developing a specialized heuristic for a specific application, which makes metaheuristics an appealing choice ..."
Abstract
 Add to MetaCart
Abstract: There are various methods to optimize the scheduling systems such as tabu search, genetic algorithms and simulated annealing etc. These methods usually require much less work than developing a specialized heuristic for a specific application, which makes metaheuristics an appealing choice for implementation in general purpose of sequencing and scheduling. Furthermore, a good metaheuristics implementation is likely to provide near optimal solutions in reasonable computational time. Among these Genetic algorithm is believed to be the most vigorous impartial random (stochastic) search algorithm for sampling a large solution space. This study demonstrates a substantial description of various genetic algorithm based techniques and its usage in scheduling and sequencing problem. A review of genetic algorithm and its intricate practices in managing different objective problems and forming hybrid procedures with parameters for scheduling problems have been explored in the present work.
National Academy of Sciences of Belarus,
"... Abstract: This article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may diff ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: This article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially solvable via Jackson's pair of job permutations, otherwise it is NPhard even if each of n jobs consists of one operation on the same machine. We present sufficient conditions when Jackson's pair of permutations may be used for solving the twomachine jobshop problem with sequencedependent setup and removal times. For the general case of this problem, the results obtained provide polynomial lower and upper bounds for the objective function value which are used in a branchandbound algorithm. Computational experiments show that an exact solution for this problem may be obtained in a suitable time for n ≤ 280. We also develop a heuristic algorithm and present a worst case analysis for it.