Results 1  10
of
221,105
The JobShop Scheduling Problem  The JobShop Scheduling Problem with setup times
, 1998
"... This paper reports a bibliographical study and some personnal works about the general Jobshop Problem and Jobshop Problems with setup times. Section 1 introduces some  usual  notations about the general problem. Specific notations concerning with setup times will be introduced later. The bibliog ..."
Abstract
 Add to MetaCart
This paper reports a bibliographical study and some personnal works about the general Jobshop Problem and Jobshop Problems with setup times. Section 1 introduces some  usual  notations about the general problem. Specific notations concerning with setup times will be introduced later
JobShop Scheduling Problem With Sequence Dependent Setup Times
"... Abstract — The majority of researches on scheduling assume setup times negligible or as a part of the processing time. In this paper, job shop scheduling with sequence dependent setup times is considered. After defining the problem, a mathematical model is developed. Implementing the mathematical mo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of the heuristic model evaluated with a wellknown example in the literature insures that the model seems to have a strong ability to solve jobshop scheduling with sequence dependent setup times problems and to obtain good solutions in reasonable computational times. Keywords: Jobshop scheduling, Heuristic model
sequencedependent
"... The metaheuristic GRASP as an upper bound for a branch and bound algorithm in a scheduling problem with nonrelated parallel machines and ..."
Abstract
 Add to MetaCart
The metaheuristic GRASP as an upper bound for a branch and bound algorithm in a scheduling problem with nonrelated parallel machines and
25 p. <10.1007/s1047900702830>. <hal00103387>
, 2006
"... branch and bound method for the jobshop problem with sequencedependent setup times ..."
Abstract
 Add to MetaCart
branch and bound method for the jobshop problem with sequencedependent setup times
SequenceDependent Setup Times in a TwoMachine JobShop with Minimizing the Schedule Length
, 2006
"... AbstractThis article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup times and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may ..."
Abstract
 Add to MetaCart
be used for solving the twomachine jobshop problem with sequencedependent setup times and removal times. For the general case of this problem, the results obtained provide polynomial lower and upper bounds for the makespan which are used in a branchandbound algorithm. Computational experiments show
SEQUENCEDEPENDENT SETUP AND CLEANUP TIMES IN A TWOMACHINE JOBSHOP WITH MINIMIZING MAKESPAN
"... Abstract: This article addresses the jobshop scheduling problem of minimizing the length of a schedule (makespan) for processing n jobs by one or two machines with sequencedependent setup times and cleanup times. The processing of each job includes at most two operations that have to be nonpreem ..."
Abstract
 Add to MetaCart
Abstract: This article addresses the jobshop scheduling problem of minimizing the length of a schedule (makespan) for processing n jobs by one or two machines with sequencedependent setup times and cleanup times. The processing of each job includes at most two operations that have to be non
Heuristics for JobShop Scheduling
, 1988
"... Two methods of obtaining approximate solutions to the classic General JobShop Scheduling Problem are investigated. The first method is iterative. A sampling of the solution space is used to decide which of a collection of space pruning constraints are consistent with "good" schedules. Th ..."
Abstract
 Add to MetaCart
Two methods of obtaining approximate solutions to the classic General JobShop Scheduling Problem are investigated. The first method is iterative. A sampling of the solution space is used to decide which of a collection of space pruning constraints are consistent with "good" schedules
A Multicriteria Scheduling with SequenceDependent Setup Times
"... In this paper a multicriteria scheduling problem with sequencedependent setup times on a single machine is considered. The objective function of the problem is minimization of the weighted sum of total completion time, maximum tardiness and maximum earliness. An integer programming model is develop ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper a multicriteria scheduling problem with sequencedependent setup times on a single machine is considered. The objective function of the problem is minimization of the weighted sum of total completion time, maximum tardiness and maximum earliness. An integer programming model
Results 1  10
of
221,105