Results 1 
8 of
8
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.
EarlyTardy Minimization for Joint Scheduling of Jobs and Maintenance Operations on a Single Machine
, 2006
"... AbstractIn this paper, we consider joint scheduling of jobs and preventive maintenance operations on a single machine with an objective to minimize the total earliness and tardiness of jobs about a common due date. The properties of an optimal schedule are identified and utilized to develop a constr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
AbstractIn this paper, we consider joint scheduling of jobs and preventive maintenance operations on a single machine with an objective to minimize the total earliness and tardiness of jobs about a common due date. The properties of an optimal schedule are identified and utilized to develop a constructive heuristic and a lower bound estimate. The properties are also utilized to hybridize Tabu search and Simulated Annealing algorithms. A numerical study with over 3200 randomly generated problems is reported to demonstrate the performance of the proposed solution methods. The study shows that the effectiveness of the proposed lower bound and constructive heuristic is sensitive to maintenance related parameters. We also show that hybridized Tabu search and Simulated Annealing algorithms are efficient approaches to solve the problem. KeywordsSingle machine scheduling, Maintenance, EarlyTardy, Common due date, Tabu search and simulated annealing
Parallel Machine Scheduling with Load Balancing and Sequence Dependent Setups
, 2006
"... AbstractIn this paper, we study the problem of minimizing total completion time with load balancing and sequence dependent setups in a nonidentical parallel machine environment. A mathematical model has been presented for the objective of minimizing total completion time with workload balancing con ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
AbstractIn this paper, we study the problem of minimizing total completion time with load balancing and sequence dependent setups in a nonidentical parallel machine environment. A mathematical model has been presented for the objective of minimizing total completion time with workload balancing constraint. Since this problem is an NPHard problem, some simple heuristics and a genetic algorithm are developed for efficient scheduling of resources. The heuristics and genetic algorithm are tested on random data.
A RowandColumn Generation Method to a Batch Machine Scheduling Problem
"... Abstract This paper studies a batch machine scheduling problem in which decisions on grouping jobs into batches and scheduling batches on parallel machines are jointly made. To address the problem, we model it as twostage setpartitioning (TSSP) type formulation with exponential number of rows and ..."
Abstract
 Add to MetaCart
Abstract This paper studies a batch machine scheduling problem in which decisions on grouping jobs into batches and scheduling batches on parallel machines are jointly made. To address the problem, we model it as twostage setpartitioning (TSSP) type formulation with exponential number of rows and columns. To find solutions, we propose a rowandcolumn generation method. The proposed method starts with a restricted version of the linear relaxation of (TSSP), and enlarges the model through iteratively generating needed rows and columns. The integer solution is obtained by solving the final integer programming with generated rows and columns. Experimental results show the efficiency of the proposed method.
Parallel Machine Scheduling by Family Batching with Sequenceindependent Setup Times
, 2005
"... AbstractThis paper presents a new approach for transforming MRP orders, planned periodically, e.g. on a weekly base, into a detailed schedule of jobs. In this model for a parallel machine environment, the jobs are partitioned into families and a family specific setup time is required at the start o ..."
Abstract
 Add to MetaCart
(Show Context)
AbstractThis paper presents a new approach for transforming MRP orders, planned periodically, e.g. on a weekly base, into a detailed schedule of jobs. In this model for a parallel machine environment, the jobs are partitioned into families and a family specific setup time is required at the start of each period and of each batch, where a batch is a maximal set of jobs in the same family, that are processed consecutively. An integer program is formulated for both the problem of minimising the number of overloaded periods and the problem of minimising the total overtime. These programs generate benchmark results for the heuristic approach. A heuristic model is developed that constructs a schedule in which overloaded periods are relieved and setup time is saved. In this approach, the job sequence is constructed by repeatedly solving a knapsack problem for each machine. The weights used in this knapsack problem relate to the preferred priorities of the jobs not yet scheduled and determine the quality of the final sequence. The different features of the heuristic model are compared using a large set of test problems. The results show that the quality of the final schedule depends on an appropriate choice of the weights. KeywordsSetup times, Family batching, Parallel machine scheduling
1 A Fuzzy MixedInteger Goal Programming Model for a Parallel Machine Scheduling Problem
"... Abstract: This paper presents a new mixedinteger goal programming (MIGP) model for a parallel machine scheduling problem with sequencedependent setup times and release dates under the hypothesis of fuzzy processing time’s knowledge. Two objectives are considered in the model to minimize the total ..."
Abstract
 Add to MetaCart
Abstract: This paper presents a new mixedinteger goal programming (MIGP) model for a parallel machine scheduling problem with sequencedependent setup times and release dates under the hypothesis of fuzzy processing time’s knowledge. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. At the end, the effectiveness of the proposed model is demonstrated through some test problems. Keywords: Parallel machine scheduling; Mixedinteger goal programming; Fuzzy sets theory; Release date; Sequencedependent setup time. 1
Scheduling continuous aluminium casting lines
, 2008
"... Publication details, including instructions for authors and subscription information: ..."
Abstract
 Add to MetaCart
Publication details, including instructions for authors and subscription information:
COLUMN GENERATION AND NETWORK MODELING IN LARGESCALE LOGISTICS NETWORKS
, 2011
"... Decomposition has been used in solving numerous problems in mathematics, computer ..."
Abstract
 Add to MetaCart
Decomposition has been used in solving numerous problems in mathematics, computer