Results 1  10
of
135
Combination of Twomachine Flow Shop Scheduling and Shortest Path Problems
"... Abstract. This paper studies a combinatorial optimization problem which is obtained by combining the twomachine flow shop scheduling problem and the shortest path problem. The objective of the obtained problem is to select a subset of jobs constitutes a feasible solution to the shortest path proble ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. This paper studies a combinatorial optimization problem which is obtained by combining the twomachine flow shop scheduling problem and the shortest path problem. The objective of the obtained problem is to select a subset of jobs constitutes a feasible solution to the shortest path
An Enumerative Algorithm for TwoMachine Flow Shop Problems with Earliness and Tardiness Penalties
"... We consider a twomachine flow shop problem with a common due date where the objective is to minimize the sum of functions which penalize early as well as tardy completion of jobs. Since the problem is NPhard in the strong sense, we investigate some general properties of optimal schedules for t ..."
Abstract
 Add to MetaCart
We consider a twomachine flow shop problem with a common due date where the objective is to minimize the sum of functions which penalize early as well as tardy completion of jobs. Since the problem is NPhard in the strong sense, we investigate some general properties of optimal schedules
An Improved Approximation Algorithm for TwoMachine Flow Shop Scheduling With an Availability Constraint
, 2004
"... We study the problem of scheduling n jobs in a twomachine flow shop where the second machine is not available for processing during a given time interval. A resumable scenario is assumed, i.e if a job cannot be finished before the down period it is continued after the machine becomes available agai ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We study the problem of scheduling n jobs in a twomachine flow shop where the second machine is not available for processing during a given time interval. A resumable scenario is assumed, i.e if a job cannot be finished before the down period it is continued after the machine becomes available
A Genetic Algorithm for the Two Machine Flow Shop Problem
"... In scheduling, the two machine flow shop problem F2  � Ci is to find a schedule that minimizes the sum of finishing times of an arbitrary number of jobs that need to be executed on two machines, such that each job must complete processing on machine 1 before starting on machine 2. Finding such a ..."
Abstract
 Add to MetaCart
In scheduling, the two machine flow shop problem F2  � Ci is to find a schedule that minimizes the sum of finishing times of an arbitrary number of jobs that need to be executed on two machines, such that each job must complete processing on machine 1 before starting on machine 2. Finding such a
Minimizing Total Completion Time in a Twomachine Flowshop Scheduling Problems
"... Abstract: We consider the problem of twomachine flowshop scheduling with a single server and unit processing times, we show that this problem is NPhard in the strong sense and present a busy schedule for it with worstcase bound 7 / 6. Key words: flowshop scheduling problem, total completion tim ..."
Abstract
 Add to MetaCart
Abstract: We consider the problem of twomachine flowshop scheduling with a single server and unit processing times, we show that this problem is NPhard in the strong sense and present a busy schedule for it with worstcase bound 7 / 6. Key words: flowshop scheduling problem, total completion
Lot splitting to minimize average flowtime in a twomachine flowshop
, 1999
"... Lot splitting is a technique for accelerating the flow of work by splitting job lots into sublots. In this paper we investigate the lot splitting scheduling problem in a twomachine flowshop environment with detached setups and with batch availability. The performance measure considered is the aver ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Lot splitting is a technique for accelerating the flow of work by splitting job lots into sublots. In this paper we investigate the lot splitting scheduling problem in a twomachine flowshop environment with detached setups and with batch availability. The performance measure considered
A PolynomialTime Approximation Scheme for the TwoMachine Flow Shop Scheduling Problem With an Availability Constraint
, 2004
"... We study the problem of scheduling n preemptable jobs in a twomachine flow shop where the first machine is not available for processing during a given time interval. The objective is to minimize the makespan. We propose a polynomialtime approximation scheme for this problem. The approach is extende ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We study the problem of scheduling n preemptable jobs in a twomachine flow shop where the first machine is not available for processing during a given time interval. The objective is to minimize the makespan. We propose a polynomialtime approximation scheme for this problem. The approach
Metaheuristic Approaches for the TwoMachine FlowShop Problem with Weighted Late Work Criterion and Common Due Date
"... Abstract: In this paper, metaheuristic approaches for the twomachine flow shop problem with a common due date and the weighted late work performance measure (F2dj=dYw) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, ..."
Abstract
 Add to MetaCart
Abstract: In this paper, metaheuristic approaches for the twomachine flow shop problem with a common due date and the weighted late work performance measure (F2dj=dYw) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs
Fast algorithms to minimize the makespan or maximum lateness in the twomachine flow shop with release times, 2002
 Journal of Scheduling
"... Abstract We consider the twomachine flowshop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a unified treatment of various sequenceinterchange operators and show the reasons why the usefulness of traditional adjacent intercha ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract We consider the twomachine flowshop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a unified treatment of various sequenceinterchange operators and show the reasons why the usefulness of traditional adjacent
Results 1  10
of
135