نتایج جستجو برای: sizing and scheduling problem are classified in strongly np
تعداد نتایج: 21874981 فیلتر نتایج به سال:
We consider a problem of multi-product lot-sizing and scheduling where each product can be produced by a family of alternative multi-machine technologies. Multi-machine technologies require one or more machine at the same time. A sequence dependent setup time is needed between different technologies. The criterion is to minimize the makespan. Preemptive and non-preemptive versions of the proble...
the present dissertation aims to investigate four-word lexical bundles in applied linguistics research articles by iranian and internationally-published writers. the aims of this study are two-fold: first of all, attempts have been made to create a comprehensive list of the most commonly used four-word lexical bundles categorized by their type and token frequency, their structural characteristi...
the present paper deals with criminal issues. for example, legal injunction on the necessity of returning a deposit has a legal nature and legal injunction on the punishment of those who breach the trust has a criminal nature. existing social issues are the basis of classification of some instances into the issue, some of which are based on variation and others on quality. therefore, the motiva...
the allocation of human resources to project activities in order to schedule them is one of the closest states to the actual conditions of scheduling problems. but regarding the fact that this problem belongs to the class of np-hard problems; so far the exact methods have only been able to solve the small size problems. in this study, the renewable resources are humans in a way that every staff...
it is not possible to understand developments of a country’s culture and civilization without knowing his believes and myths. whether it is north or south, east or west, planes or mountains, sahara or deserts, here in iran every corner includes valuable and precious treasures which are known all over the world, and cultural – historical objects which are found here adorn all well known museums...
We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is the retailer level and the second one is the supplier level. The aim is to minimize the cost of the supply chain so as to satisfy the demands when the quantity of item that can be held in inventory at each period is ...
In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید