نتایج جستجو برای: deteriorating jobs
تعداد نتایج: 26232 فیلتر نتایج به سال:
We estimate the short- and long-run labor market impacts of parenthood in a developing country, Chile, based on an event-study approach around birth first child. find that becoming mother implies sharp decline employment, working hours, earnings, while fathers' outcomes remain unaffected. Importantly, child also produces strong increase informality among mothers (38%). All these are milder for ...
This paper addresses some single-machine scheduling problems with past-sequence-dependent (p-s-d) delivery times and deteriorating jobs. By the past-sequence-dependent (p-s-d) delivery times, we mean that the delivery time of any job is proportional to the job’s waiting time. It is assumed that the deterioration process reflects a increase in the process time as a function of the job’s starting...
Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs L-H Sun1,2,3, L-Y Sun3,4,5 and J-B Wang2,6∗ 1School of Business Administration, Xi’an University of Technology, Xi’an, People’s Republic of China; 2Knowledge Management & Innovation Research Centre, Xi’an Jiaotong University, Xi’an, People’s Republic of China; 3The State Key Laboratory on M...
this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...
This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...
We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection. Each job is either accepted and processed on a single batching machine, or rejected by paying penalties. The processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of t...
Article history: Received 5 August 2013 Received in revised form 2 May 2014 Accepted 28 May 2014 Communicated by D.-Z. Du
In this article, we study a single-machine scheduling problem of minimizing the total tardiness for a set of independent jobs. The processing time of a job is modeled as a step function of its starting time and a specific deteriorating date. A mixed integer programming model was applied to the problem and validated. Since the problem is known to be NP-hard, we proposed a heuristic named simple ...
Article history: Received 28 July 2010 Received in revised form 26 April 2011 Accepted 24 May 2011 Available online 27 May 2011 Communicated by A.A. Bertossi
We consider a single machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time and the machine is subject to an availability constraint. We consider the non-resumable case. The objectives are to minimize the makespan and the total completion time. We show that both problems are NP-hard and present pseudo-polynomial time optimal ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید