Single-machine scheduling with time window-dependent processing times
نویسندگان
چکیده
منابع مشابه
Single-machine scheduling with time window-dependent processing times
In the one-machine scheduling problems analysed in this paper, the processing time of a job depends on the time at which the job is started. More precisely, the horizon is divided into time windows and with each one a coe cient is associated that is used to determine the actual processing time of a job starting in it. Two models are introduced, and one of them has direct connections with models...
متن کاملBicriterion Single Machine Scheduling with Resource Dependent Processing Times
A bicriterion problem of scheduling jobs on a single machine is studied. The processing time of each job is a linear decreasing function of the amount of a common discrete resource allocated to the job. A solution is specified by a sequence of the jobs and a resource allocation. The quality of a solution is measured by two criteria, F1 and F2. The first criterion is the maximal or total (weight...
متن کاملIdentical parallel machine scheduling with time-dependent processing times
In the literature, most of the parallel-machine scheduling problems, in which the processing time of a job is a linear function of its starting time, are proved to be NP-hard. In this paper, we study a parallel-machine scheduling problem in which the processing time of a job is a linear function of its starting time. The objectives are to minimize the total completion of all jobs and the total ...
متن کاملMachine scheduling with resource dependent processing times
We consider several parallel machine scheduling settings with the objective to minimize the schedule makespan. The most general of these settings is unrelated parallel machine scheduling. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the usage of a scarce renewable resource. A given amount of that resource, e.g. workers, can be distributed...
متن کاملSingle-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times
We consider single-machine scheduling problems with past-sequence-dependent (p-s-d) job delivery times. The p-s-d delivery time is needed to remove any waiting time-induced adverse effects on the job’s condition (prior to delivering the job to the customer) and it is therefore proportional to the job’s waiting time. We show that single-machine scheduling problems with p-s-d delivery times and w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2006
ISSN: 0160-5682,1476-9360
DOI: 10.1057/palgrave.jors.2601931