Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 121, Issue -, Pages 189-194Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.05.035
Keywords
Parallel-machine scheduling; Variable processing times; Learning effect; Maximum completion time; Total completion time
Ask authors/readers for more resources
We introduce a new model of parallel-machine scheduling with job processing times described by proper Riemann integrals of a given function. We also formulate and prove a few properties of that model. Based on presented results, we show that some problems of parallel-machine scheduling of jobs with integral-based learning effect can be solved using polynomial algorithms applied earlier to fixed job processing times.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available