Abstract

A general model on single-machine scheduling problems with past-sequence-dependent delivery times is developed in this paper, where the actual processing time of a job is defined by a function of its position in a schedule. Moreover, position-dependent effects in both processing times and delivery times are considered simultaneously. Problems with completion time related criteria are presented and the following objective functions: the makespan, the flowtime, the total absolute differences in completion times and their linear combinations are studied. It is shown that all the studied problems can be solved by polynomial-time algorithm.

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 call

Disclaimer: 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.