Results 1  10
of
77,145
The twomachine flowshop serialbatching scheduling problem with limited batch size
, 2009
"... ..."
SCHEDULING THE TWOMACHINE OPEN SHOP PROBLEM WITH NONSYMMETRIC TIME DELAYS
"... The paper considers a problem of scheduling n jobs in a twomachine open shop model so as to minimize the overall completion time, also called the makespan. When taking into account the time delay between the completion of an operation and the beginning of the next operation of the same job, the res ..."
Abstract
 Add to MetaCart
The paper considers a problem of scheduling n jobs in a twomachine open shop model so as to minimize the overall completion time, also called the makespan. When taking into account the time delay between the completion of an operation and the beginning of the next operation of the same job
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
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 Heuristic Algorithm for Minimizing the Expected Makespan in TwoMachine Flow Shops with Fuzzy Processing Time
, 2008
"... Production scheduling, with the objective of minimizing the makespan, is an important task in manufacturing systems. In the past, the processing time for each job was usually assumed to be exactly known, but in many realworld applications, processing times may vary dynamically due to human factors ..."
Abstract
 Add to MetaCart
or operating faults. Fuzzy programming theory has been developed for flow shop scheduling problems with uncertain processing times. In this article, the processing times are described by triangular fuzzy numbers. A new heuristic algorithm is also developed and presented which draws upon Johnson’s algorithm
Batch Scheduling in a Two Machine Flow Shop with Limited Buffer and Sequence Independent Setup Times
, 2001
"... The problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number c of parts is known to be NPhard for any c > 0 and c ≤ n, where n is the number of jobs. In this paper we analyze this problem in the context of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number c of parts is known to be NPhard for any c > 0 and c ≤ n, where n is the number of jobs. In this paper we analyze this problem in the context
Survey of Job Shop Scheduling Techniques
"... Scheduling has been defined as "the art of assigning resources to tasks in order to insure the termination of these tasks in a reasonable amount of time " (1). According to French (2), the general problem is to find a sequence, in which the jobs (e.g., a basic task) pass between th ..."
Abstract
 Add to MetaCart
the resources (e.g., machines), which is a feasible schedule, and optimal with respect to some performance criterion. Graves (3) introduced a functional classification scheme for scheduling problems. This scheme categorizes problems using the following dimensions: 1. Requirement generation, 2. Processing
Complex Job Shop Multiple Orders per Job Scheduling
"... Semiconductor manufacturing production scheduling is a challenging task due to process complexity that includes the assignment of customer orders to front opening unified pods (FOUPs), FOUP batch processing, parallel machines, and reentrant flow. A networkbased optimization model and a column gen ..."
Abstract
 Add to MetaCart
Semiconductor manufacturing production scheduling is a challenging task due to process complexity that includes the assignment of customer orders to front opening unified pods (FOUPs), FOUP batch processing, parallel machines, and reentrant flow. A networkbased optimization model and a column
INDUSTRIAL APPLICATIONS IN JOB SHOP SCHEDULING
, 1983
"... Artificial intelligence techniques for industrial applications in job shop scheduling. ..."
Abstract
 Add to MetaCart
Artificial intelligence techniques for industrial applications in job shop scheduling.
Literature Review of Open Shop Scheduling Problems
"... This paper discusses review of literature of open shop scheduling problems. First, the problem is classified as per different measures of performance, viz., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs, minimi ..."
Abstract
 Add to MetaCart
This paper discusses review of literature of open shop scheduling problems. First, the problem is classified as per different measures of performance, viz., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs
Results 1  10
of
77,145