Order acceptance and scheduling with consideration of service level

Jinwen Ou () and Xueling Zhong ()
Additional contact information
Jinwen Ou: Jinan University
Xueling Zhong: Guangdong University of Finance

Annals of Operations Research, 2017, vol. 248, issue 1, No 17, 429-447

Abstract: Abstract In traditional order acceptance and scheduling (OAS) research, there is no constraint on how many orders are allowed to be rejected in total. We study OAS with consideration of service level in this paper. In our OAS model, there are n orders and m machines available at time zero. To maintain a predefined high service level, the number of orders to be rejected is limited to be no greater than a given value k. The objective is to minimize the completion time of the last accepted order plus the total penalty of all rejected orders. The problem is NP-hard in the strong sense in general. For the special case with a single machine (i.e., when $$m=1$$ m = 1 ), we present an exact algorithm with a complexity of $$O(n\log k)$$ O ( n log k ) . For the general case, we first propose an $$O(n\log n)$$ O ( n log n ) heuristic with a worst-case bound of $$2-\frac{1}{m}$$ 2 - 1 m , followed by a sophisticated heuristic by making use of LP-relaxation and bin-packing techniques. The second heuristic has a worst-case bound of $$1.5+\epsilon $$ 1.5 + ϵ and a time complexity of $$O(n\log n + nm^2/\epsilon )$$ O ( n log n + n m 2 / ϵ ) , where $$\epsilon >0$$ ϵ > 0 can be any small given constant.

Keywords: Order acceptance and scheduling; Service level; Heuristic; Performance ratio (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-016-2277-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:248:y:2017:i:1:d:10.1007_s10479-016-2277-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-016-2277-2

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().