The Loading Time Scheduling Problem
نویسندگان
چکیده
منابع مشابه
The Loading Time Scheduling Problem
In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a speciied subset of the machines. Each machine has a loading time that is incurred only for the rst task that is scheduled on the machine in a particular run. This basic scheduling problem arises in the context of machining on numerically controlled machines , query optimization in databa...
متن کاملThe Loading Time Scheduling Problem 1
In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a speci ed subset of the machines. Each machine has a loading time that is incurred only for the rst task that is scheduled on the machine in a particular run. This basic scheduling problem arises in the context of machining on numerically controlled machines, query optimization in databas...
متن کاملThe Batch Loading and Scheduling Problem
This paper discusses a problem that commonly occurs in the batching and schedulingof certainkinds of batch processors. Examplesof these processors include heat treatment facilities, particularly in the steeland ceramicindustries as well as a varietyof operations in the manufacture of integratedcircuits. There are a set of jobs waiting to be processed. The processing time for a batchdependsonly ...
متن کاملThe Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System
Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs. In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...
متن کاملOptimum Aggregate Inventory in the Lot Scheduling Problem with Non-Zero Setup Time
In this paper, the minimization of the maximum aggregate inventory of all products for the common cycle time approach to the scheduling problem of a multi-products single machine system is considered. In the case of non-zero set up time and limited resources, a simply and easy to apply rule has been obtained for this optimization problem. Using this rule, one can obtain the optimal production s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2000
ISSN: 0196-6774
DOI: 10.1006/jagm.2000.1076