Scheduling with two competing agents to minimize total weighted earliness
Sign Up to like & getrecommendations! Published in 2017 at "Annals of Operations Research"
DOI: 10.1007/s10479-016-2310-5
Abstract: We study a single machine scheduling problem with two competing agents and earliness measures. Given a common deadline for all the jobs of both agents, the objective function is minimizing the total weighted earliness of… read more here.
Keywords: earliness; two competing; competing agents; dynamic programming ... See more keywords
Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Business Economics"
DOI: 10.1007/s11573-020-00970-6
Abstract: A bi-criteria scheduling problem for parallel identical batch processing machines in semiconductor wafer fabrication facilities is studied. Only jobs belonging to the same family can be batched together. The performance measures are the total weighted… read more here.
Keywords: tardiness electricity; batch; total weighted; electricity cost ... See more keywords
A Competitive Online Algorithm for Minimizing Total Weighted Completion Time on Uniform Machines
Sign Up to like & getrecommendations! Published in 2020 at "Mathematical Problems in Engineering"
DOI: 10.1155/2020/7527862
Abstract: We consider the classic online scheduling problem on m uniform machines in the online setting where jobs arrive over time. Preemption is not allowed.*e objective is to minimize total weighted completion time. An online algorithm… read more here.
Keywords: weighted completion; time; uniform machines; completion time ... See more keywords