Results 1 
6 of
6
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.
Group Scheduling Problems In Flexible Flow Shops
 Proc. of the Annual Conference of Institute of Industrial Engineers
, 2002
"... Flexible flow shops are becoming increasingly common in industry practice because of higher workloads imposed by jobs on one or more stages, thus requiring two or more units of the same machine type. We present a methodology for solving this important problem, namely group scheduling, within the c ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Flexible flow shops are becoming increasingly common in industry practice because of higher workloads imposed by jobs on one or more stages, thus requiring two or more units of the same machine type. We present a methodology for solving this important problem, namely group scheduling, within the context of cellular manufacturing systems in order to minimize the total completion time of all groups of jobs considered in the planning horizon. Two different setup options, namely ############ and ###############, are investigated for jobs within the same group. A combined heuristic solution algorithm, comprised of single and multiplepass heuristics, is used for solving the problem. An example problem, consisting of three different problem instances of the same structure, is used to not only demonstrate the applicability of the solution algorithm, but also to identify the setup to ####### job run time ratios that should ###############prevail across all stages represented by two or more identical units in order to select ############### over ############ or vice versa. Keywords Group Scheduling; Flexible Flow Shops 1.
Fuzzy Programming Approach for a Multiobjective Single Machine Scheduling Problem with Stochastic Processing Time
, 2008
"... Abstract This paper considers a fuzzy programming approach for a multiobjective single machine scheduling problem when processing times of jobs are normal random variables. The probabilistic problem is converted into an equivalent deterministic programming problem. Then the fuzzy programming techn ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract This paper considers a fuzzy programming approach for a multiobjective single machine scheduling problem when processing times of jobs are normal random variables. The probabilistic problem is converted into an equivalent deterministic programming problem. Then the fuzzy programming technique has been applied to obtain a compromise solution. A numerical example demonstrates the feasibility of applying the proposed model to single machine scheduling problem. Index Terms — Single machine scheduling, Normal random variable, Fuzzy programming
Inventory Based BiObjective Flow Shop Scheduling Model and Its Hybrid Genetic Algorithm
"... Flow shop scheduling problem is a typical NPhard problem, and the researchers have established many different multiobjective models for this problem, but none of these models have taken the inventory capacity into account. In this paper, an inventory based biobjective flow shop scheduling model ..."
Abstract
 Add to MetaCart
(Show Context)
Flow shop scheduling problem is a typical NPhard problem, and the researchers have established many different multiobjective models for this problem, but none of these models have taken the inventory capacity into account. In this paper, an inventory based biobjective flow shop scheduling model was proposed, in which both the total completion time and the inventory capacity were as objectives to be optimized simultaneously. To solve the proposed model more effectively, we used a tailormade crossover operator, and mutation operator, and designed a new local search operator, which can improve the local search ability of GA greatly. Based on all these, a hybrid genetic algorithm was proposed. The computer simulations were made on a set of benchmark problems, and the results indicated the effectiveness of the proposed algorithm.
A New Metaheuristic for Scheduling of Single Machine Problem with Sequence Dependent Setups
, 2010
"... Abstract: In many realworld production systems, it requires an explicit consideration of sequencedependent setup times when scheduling jobs. As for the scheduling criterion, the tardiness, holding and setup costs are always regarded as the most important criteria in practical systems. Considering ..."
Abstract
 Add to MetaCart
Abstract: In many realworld production systems, it requires an explicit consideration of sequencedependent setup times when scheduling jobs. As for the scheduling criterion, the tardiness, holding and setup costs are always regarded as the most important criteria in practical systems. Considering all of these criterions has received little attention in the scheduling literature. In this paper, we present a new metaheuristic for such a problem in a singlemachine environment. To comply with industrial situations, the dynamic release of jobs is assumed. Also there is an upper limit for the setup cost of each job and based on it, some sequences maybe impossible. It also provides guidelines that can be used by practitioners in the process of selecting the appropriate scheduling methodology.