نتایج جستجو برای: controllable processing times
تعداد نتایج: 831156 فیلتر نتایج به سال:
Four studies examined whether verbal behavior is mindful (cognitive) or mindless (automatic). All used Langer, Blank, and Chanowitz's (1978) experimental paradigm. Experimenters approached subjects at copying machines and asked to use it first. Their requests varied in the amount and kind of information given. Study 1 found less compliance when experimenters gave a controllable reason (". . . b...
In this paper, we propose a new methodology for the speed scaling problem based on its link to scheduling with controllable processing times and submodular optimization. It results in faster algorithms for traditional speed scaling models, characterized by a common speed/energy function. In addition, it handles e¢ciently the most general models with job-dependent speed/energy functions, with a ...
We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost. In this paper, we propose fast divide-and-conquer algorithms for these scheduling problems. Our approach is based on the observation that each scheduling problem we discuss can be...
We study flowshop scheduling problems with respect to slack due window assignments, which are operations in jobs assigned an individual window. We combine learning effect and controllable processing times, the has a two-machine no-wait setup. The goal is determine job sequence, based on common flow allowance, size, resource allocation. provide bicriteria analysis fo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید