Some new problems on two-agent scheduling to minimize the earliness costs

Shuenn-Ren Cheng

International Journal of Production Economics, 2014, vol. 156, issue C, 24-30

Abstract: We consider several two-agent scheduling problems, where agents A and B have to share a single machine while processing their jobs. The objective is to minimize a certain objective function which depends on the completion time of all the jobs, while keeping the objective of agent B (with regard to its jobs only) below or at a fixed level Q. Specifically, we focus on minimizing certain objective functions of all the jobs such as maximum earliness cost, total weighted earliness cost, and total weighted earliness and tardiness cost, subject to an upper bound on a certain objective function of agent B. We introduce polynomial time solution for the maximum earliness cost problem, and prove NP-hardness for the total weighted earliness cost and total weighted earliness and tardiness cost cases. We also discuss some polynomially solvable cases for the total weighted earliness cost problem.

Keywords: Single-machine; Two-agent; Maximum earliness cost; Total weighted earliness cost (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527314001601
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:156:y:2014:i:c:p:24-30

DOI: 10.1016/j.ijpe.2014.05.004

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().