Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time
In this paper, we consider single-machine due window assignment and scheduling with a common flow allowance and controllable job processing times, subject to unlimited or limited resource availability. Due window assignment with a common flow allowance means that each job has a job-dependent due window, the starting time and completion time of which are equal to its actual processing time plus the job-independent parameters q1, respectively, which are common to all the jobs. The processing time of each job is either a linear or a convex function of the amount of a common continuously divisible resource allocated to the job. We study five versions of the problem that differ in terms of the objective function and processing time function being used. We provide structural properties of the optimal schedules and polynomial-time solution algorithms for the considered problems.
Year of publication: |
2014
|
---|---|
Authors: | Yin, Y ; Cheng, T C E ; Wu, C-C ; Cheng, S-R |
Published in: |
Journal of the Operational Research Society. - Palgrave Macmillan, ISSN 0160-5682. - Vol. 65.2014, 1, p. 1-13
|
Publisher: |
Palgrave Macmillan |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Wu, C-C, (2013)
-
Wu, C-C, (2013)
-
Single-machine scheduling of proportionally deteriorating jobs by two agents
Gawiejnowicz, S, (2011)
- More ...