Abstract
Abstract 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
