Results 1 
9 of
9
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.
The hybrid flow shop scheduling problem
 European Journal of Operational Research
, 2010
"... The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper pr ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
(Show Context)
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed for its solution. The paper discusses several variants of the HFS problem, each in turn considering different assumptions, constraints and objective functions. Research opportunities in HFS are also discussed. 1
Multiprocessor task scheduling in multistage hybrid flow shops: A genetic algorithm approach
 Journal of the Operational Research Society
"... This paper considers multiprocessor task scheduling in a multistage hybrid flowshop environment. The objective is to minimize the makespan, i.e. the completion time of all the tasks in the last stage. This problem is of practical interest in the textile and process industries. A genetic algorithm ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper considers multiprocessor task scheduling in a multistage hybrid flowshop environment. The objective is to minimize the makespan, i.e. the completion time of all the tasks in the last stage. This problem is of practical interest in the textile and process industries. A genetic algorithm (GA) is developed to solve the problem. The GA is tested against a lower bound from the literature as well as against heuristic rules on a test bed comprised of 400 problems with up to 100 jobs, 10 stages, and with up to 5 processors on each stage. For small problems, solutions found by the GA are compared to optimal solutions, which are obtained by total enumeration. For larger problems, optimum solutions are estimated by a statistical prediction technique. Computational results show that the GA is both effective and efficient for the current problem. Test problems are provided in a web site at www.benchmark.ibu.edu.tr/mpthfsp Key words: multiprocessor tasks, hybrid flowshops, makespan minimization, genetic algorithms.
A Novel Imperialist Competitive Algorithm to Solve Flexible Flow Shop Scheduling Problem in Order to Minimize Maximum Completion Time
"... This paper demonstrates solving the flexible flow shop scheduling problem (FFSP) with considering limited waiting time constraint, sequence dependent setup times and different ready time to minimize maximum completion time (i.e. makespan). Since the problem studied is NPhard, metaheuristic algorith ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
This paper demonstrates solving the flexible flow shop scheduling problem (FFSP) with considering limited waiting time constraint, sequence dependent setup times and different ready time to minimize maximum completion time (i.e. makespan). Since the problem studied is NPhard, metaheuristic algorithms are proper to solve this class of problems. Hence, in this paper, a novel imperialist competitive algorithm (ICA) is proposed to tackle of addressed problem. In order to achieve the reliable results in our proposed algorithm, a comprehensive tuning is performed using Taguchi method. to validate this proposed algorithm, the other popular algorithm namely simulated annealing is developed for this goal. Simulation results indicated that ICA is superior to SA.
19 th International Conference on Production Research SCHEDULING A THERMALPRINTED LABEL MANUFACTURING PLANT USING AN EVOLUTIONARY ALGORITHM
"... This paper considers our work in progress on the problem of scheduling production activities in a reallife manufacturing plant. The problem is modelled as a twostage flexible flow shop problem with minimization of the makespan and the number of tardy jobs. The design approach of an evolutionary al ..."
Abstract
 Add to MetaCart
(Show Context)
This paper considers our work in progress on the problem of scheduling production activities in a reallife manufacturing plant. The problem is modelled as a twostage flexible flow shop problem with minimization of the makespan and the number of tardy jobs. The design approach of an evolutionary algorithm is described. Preliminary experiments are performed and results obtained show the improvement on the makespan and the diminution of tardy jobs. This motivate the actual implement of the proposed procedure in the factory. Keywords: Scheduling, evolutionary algorithm, makespan, tardy jobs, thermal transfer, printedlabel manufacturing.
identical Parallel Machine Flow Shop
"... Abstract. The drumbufferrope (DBR) is a scheduling technique under the Theory of Constraints (TOC) philosophy. In DBR, “drum ” is a schedule at the bottleneck, “rope ” is a mechanism to release the required material to the bottleneck, and “buffer ” is used to protect the bottleneck from starvation ..."
Abstract
 Add to MetaCart
Abstract. The drumbufferrope (DBR) is a scheduling technique under the Theory of Constraints (TOC) philosophy. In DBR, “drum ” is a schedule at the bottleneck, “rope ” is a mechanism to release the required material to the bottleneck, and “buffer ” is used to protect the bottleneck from starvation due to statistical fluctuations. For a nonidentical parallel machine flow shop environment, estimating rope and time buffer is not an easy task because of the complexity of nonidentical parallel machine loading. This paper proposes a new scheduling method, which is called modified DBR (ModDBR). It uses a backward finite capacity scheduling technique instead of the rope in traditional DBR. A simulation model is constructed to investigate the effect of the loading methods, priority dispatching rules, and load levels on tardiness, earliness, flow time, and bottleneck’s utilization. The results show that ModDBR tends to outperform other loading methods in terms of tardiness, average flow time, and bottleneck utilization. However, ModDBR is inferior to others in term of earliness. These findings are still valid when bottleneck location and protective capacity level are changed.
Research Article Efficient Bounding Schemes for the TwoCenter Hybrid Flow Shop Scheduling Problem with Removal Times
"... Copyright © 2014 Lotfi Hidri et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We focus on the twocenter hybrid flow shop sched ..."
Abstract
 Add to MetaCart
(Show Context)
Copyright © 2014 Lotfi Hidri et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We focus on the twocenter hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NPHard problem. These procedures are based on the optimal solution of the parallel machine scheduling problemwith release dates and delivery times.The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures. 1.
CREDIBILITYBASED FUZZY PROGRAMMING MODELS TO SOLVE THE BUDGETCONSTRAINED FLEXIBLE FLOW LINE PROBLEM
"... Abstract. This paper addresses a new version of the flexible flow line problem, i.e., the budget constrained one, in order to determine the required number of processors at each station along with the selection of the most economical process routes for products. Since a number of parameters, such ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. This paper addresses a new version of the flexible flow line problem, i.e., the budget constrained one, in order to determine the required number of processors at each station along with the selection of the most economical process routes for products. Since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzzy) in practice, they are treated as fuzzy variables. Furthermore, to investigate the model behavior and to validate its attribute, we propose three fuzzy programming models based upon credibility measure, namely expected value model, chanceconstrained programming model and dependent chanceconstrained programming model, in order to transform the original mathematical model into a fuzzy environment. To solve these fuzzy models, a hybrid metaheuristic algorithm is proposed in which a genetic algorithm is designed to compute the number of processors at each stage; and a particle swarm optimization (PSO) algorithm is applied to obtain the optimal value of tardiness variables. Finally, computational results and some concluding remarks are provided. 1.