Results 1  10
of
12
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.
Scheduling with inserted idle time: problem taxonomy and literature review
 Operations Research
, 2000
"... In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and=or dynamically arriving jobs with due dates come ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and=or dynamically arriving jobs with due dates come into play. We provide a taxonomy of environments in which IIT scheduling is relevant, review the extant literature on IIT scheduling, and identify areas of opportunity for future research. 1.
Scheduling unrelated parallel machines with resourceassignable sequence dependent setup times
, 2007
"... A novel scheduling problem that results from the addition of resourceassignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence dependent setup times. The new characteristic is that the amount of setup time do not only depend on the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A novel scheduling problem that results from the addition of resourceassignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence dependent setup times. The new characteristic is that the amount of setup time do not only depend on the machine and job sequence, but also on a number of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the number of resources assigned to them. The objective function considered is a linear combination of total completion time and the total number of resources assigned. We present a MIP model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed.
Service Quality Dimensions of Electricity Services: Evidence from Electricity Board in Sri Lanka
"... The paper tries to develop an empirical model of service quality in terms of electricity services that may form a basis for a better understanding of its determinants. Specifically, it's aimed to identify the dimensions of service quality of electricity services provided by the Ceylon Electrici ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
The paper tries to develop an empirical model of service quality in terms of electricity services that may form a basis for a better understanding of its determinants. Specifically, it's aimed to identify the dimensions of service quality of electricity services provided by the Ceylon Electricity Board located in Badulla District. The study employs exploratory factor analysis (EFA) and the service quality dimensions are identified using it as an independence technique. Data were collected by a structured questionnaire that consists of two sections as Part A and B. A total of 300 usable responses (n =300) were obtained through simple random sampling technique. The model consists of five dimensions such as tangibility, empathy, responsiveness, reliability, and assurance that have been detected by exploratory factor analysis. Further, results revealed that dimensions extracted from the analysis accounted for 62.899 percent of the total variance. While the study limits to the electricity services provided by the public sector organization based in Badulla district, the findings introduce the dimensions of service quality for electricity services, which may be a base for other scholars.
FOR
, 2006
"... Prof. Dr. Canan Özgen Director I certify that this thesis satisfies all the requirements as a thesis for the degree of Master of Science. ..."
Abstract
 Add to MetaCart
Prof. Dr. Canan Özgen Director I certify that this thesis satisfies all the requirements as a thesis for the degree of Master of Science.
Scheduling Multiple Families of Jobs on Parallel Machines to Minimize Total Weighted Completion Time
, 2000
"... We consider the problem of scheduling multiple families of jobs on identical parallel machines to minimize the total weighted completion time of the jobs. In this problem# a setup time is necessary whenever a job from one family is processed immediately after another job from a di#erent family. The ..."
Abstract
 Add to MetaCart
We consider the problem of scheduling multiple families of jobs on identical parallel machines to minimize the total weighted completion time of the jobs. In this problem# a setup time is necessary whenever a job from one family is processed immediately after another job from a di#erent family. The setup time could be sequence independent or sequence dependent. We propose a column generation based approach for #nding an optimal solution of the problem. The computational results show that the approach is capable of solving problems of medium size to optimality within reasonable computational time. Key words# Parallel machine scheduling# Setup times# Set partitioning# Column generation# Branch and bound 1 Introduction Machine scheduling problems with multiple job families #MJF# arise in many practical man# ufacturing situations where jobs to be processed can be divided into di#erent families such that jobs in di#erent families require di#erent sets of processing facilities. In such pr...
EFFICIENT ALGORITHMS FORMACHINE SCHEDULING PROBLEMSWITH EARLINESS AND TARDINESS PENALTIES
"... Abstract In this paper, we study multiple machine scheduling problems with early/tardy penalties and sequence dependent setup times. One commonality among works in the literature is that virtually all algorithms decompose the problem into two subproblems the sequencing problem and the timetabling ..."
Abstract
 Add to MetaCart
Abstract In this paper, we study multiple machine scheduling problems with early/tardy penalties and sequence dependent setup times. One commonality among works in the literature is that virtually all algorithms decompose the problem into two subproblems the sequencing problem and the timetabling problem. Sequencing problem focuses on assigning a job to some machine and determine the execution sequence on each machine. We call such assignment a semischedule. The timetabling problem focuses on finding an optimal schedule for each semischedule. The timetabling problem is polynomialtime solvable. The major challenge of finding good solutions is hence to find good quality semischedule, which is strongly NPhard in general. This paper has two contributions. We first propose a more computationally efficient timetabling algorithm. We then apply the squeaky wheel optimization metaheuristics to solve the sequencing problem. Finally, we will demonstrate the combined strength of our proposed algorithms.
A NEW ILP MODEL FOR IDENTICAL PARALLELMACHINE SCHEDULING WITH FAMILY SETUP TIMES MINIMIZING THE TOTAL WEIGHTED FLOW TIME BY A GENETIC ALGORITHM
"... ch ive of ..."
(Show Context)
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines
, 2010
"... This paper presents a survey of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. These paral ..."
Abstract
 Add to MetaCart
(Show Context)
This paper presents a survey of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. These parallel machines are also called proportional machines or related machines. There are several measures of performance which are to be optimized in uniform parallel machines scheduling. Since, this scheduling problem is a combinatorial problem; usage of a heuristic is inevitable to obtain solution in polynomial time. This paper gives a classification of the literatures of this scheduling problem in three major categories, viz. offline scheduling, online scheduling and miscellaneous scheduling. In total, the available literatures are classified into 17 subgroups. Under each of the first two categories, the available literatures are discussed under different groups based on different measures of performance and nonpreemptive/preemptive nature of the jobs. In the last category, the literatures are discussed under three subgroups, namely nonpreemptive jobs, preemptive jobs and periodic jobs.