Two-agent scheduling of time-dependent jobs

Document Type

Article

Publication Date

8-1-2017

Abstract

We consider the problem of scheduling deteriorating jobs or shortening jobs with two agents A and B. We are interested in generating all Pareto-optimal schedules for the two criteria: (1) the total completion time of the jobs in A and the maximum cost of the jobs in B, and (2) the maximum cost of the jobs in A and the maximum cost of the jobs in B. We show that all Pareto-optimal schedules for both problems can be generated in polynomial time, whether the jobs are deteriorating or shortening.

Identifier

84955246779 (Scopus)

Publication Title

Journal of Combinatorial Optimization

External Full Text Location

https://doi.org/10.1007/s10878-016-9994-y

e-ISSN

15732886

ISSN

13826905

First Page

362

Last Page

377

Issue

2

Volume

34

Grant

11201121

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS