Order acceptance and scheduling decisions in make-to-order systems

Og[breve]uz, Ceyda, F. Sibel Salman and Zehra Bilgintürk YalçIn

International Journal of Production Economics, 2010, vol. 125, issue 1, 200-211

Abstract: We examine simultaneous order acceptance and scheduling decisions where the orders are defined by their release dates, due dates, deadlines, processing times, sequence dependent setup times and revenues in a single machine environment. The objective is to maximize total revenue, where the revenue from an order is a function of its tardiness and deadline. We give an MILP formulation which can be solved to optimality up to 15 orders. We develop three heuristic algorithms to solve large sized problems. Computational tests indicate that the proposed algorithms are both computationally efficient and effective even for instances up to 300 orders.

Keywords: Order; acceptance; Single; machine; scheduling; Sequence; dependent; setup; times; Heuristics (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (30)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(10)00051-4
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:125:y:2010:i:1:p:200-211

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 ().