Multi-site scheduling under production and transportation constraints
نویسندگان
چکیده
منابع مشابه
Flexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملIntegrating Transportation in a Multi-Site Scheduling Environment
Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of other sites to manufacture the products of the enterprise. Therefore the transportation of the raw materials and the intermediate products to the plants is an important task within the whole process of manufacturing. Scheduling p...
متن کاملOptimal Transportation under Nonholonomic Constraints
We study Monge’s optimal transportation problem, where the cost is given by optimal control cost. We prove the existence and uniqueness of an optimal map under certain regularity conditions on the Lagrangian, absolute continuity of the measures with respect to Lebesgue, and most importantly the absence of sharp abnormal minimizers. In particular, this result is applicable in the case of subriem...
متن کاملScheduling under Linear Constraints
We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and...
متن کاملflexible job shop scheduling under availability constraints
in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Integrated Manufacturing
سال: 2013
ISSN: 0951-192X,1362-3052
DOI: 10.1080/0951192x.2012.688141