Abstract
We study the online problem of single machine scheduling to minimize total general completion time. General completion time is defined as $C^{\alpha}_{j}=(C_{j})^{\alpha}$ , where C j denotes the completion time of job J j and ??1 is a constant integer. Total general completion time characterizes the feather in service that when a customer is served later in time, his dissatisfaction increases in a manner of power function. The objective function ?(C j ) ? can also be viewed as a total weighted completion time, but the "weight" is no longer a constant number. Our purpose to minimize customers' total dissatisfaction. The problem is online in the sense that all jobs arrive over time. Each job's processing time becomes known at its arrival time. Preemption is not allowed. For this online problem, we show that a lower bound on competitive ratio is 2 ? and prove that D-SPT (delayed shortest processing time) algorithm is optimal with a competitive ratio 2 ? .
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.
