Bicriteria order acceptance and scheduling with consideration of fill rate

Jinwen Ou and Xueling Zhong

European Journal of Operational Research, 2017, vol. 262, issue 3, 904-907

Abstract: In this paper, we study bicriteria order acceptance and scheduling with consideration of fill rate in a parallel-machine environment. In our scheduling model, either the number of orders being rejected, or the total processing time of the orders being rejected, is not allowed to be greater than a given value, so that a specific constraint of order fill rate is satisfied. We present efficient approximation algorithms with a performance ratio arbitrarily approaching 4/3.

Keywords: Scheduling; Bicriteria; Approximation algorithm; Worst-case analysis (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717303697
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:ejores:v:262:y:2017:i:3:p:904-907

DOI: 10.1016/j.ejor.2017.04.036

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().