کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1705297 | 1519420 | 2013 | 6 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives](/preview/png/1705297.png)
This paper studies the two-agent scheduling on an unbounded parallel-batching machine. In the problem, there are two agents A and B with each having their own job sets. The jobs of a common agent can be processed in a common batch. Moreover, each agent has an objective function to be minimized. The objective function of agent A is the makespan of his jobs and the objective function of agent B is maximum lateness of his jobs. Yazdani Sabouni and Jolai [M.T. Yazdani Sabouni, F. Jolai, Optimal methods for batch processing problem with makespan and maximum lateness objectives, Appl. Math. Model. 34 (2010) 314–324] presented a polynomial-time algorithm for the problem to minimize a positive combination of the two agents’ objective functions. Unfortunately, their algorithm is incorrect. We then dwell on the problem and present a polynomial-time algorithm for finding all Pareto optimal solutions of this two-agent parallel-batching scheduling problem.
Journal: Applied Mathematical Modelling - Volume 37, Issues 10–11, 1 June 2013, Pages 7071–7076