A Benders decomposition approach to the weighted number of tardy jobs scheduling problem on unrelated parallel machines with production costs

R. M’Hallah and T. Al-Khamis

International Journal of Production Research, 2015, vol. 53, issue 19, 5977-5987

Abstract: This paper addresses the problem of scheduling on-time jobs on unrelated parallel machines with machine production costs. The objective is to maximise the net profit which is the sum of the weights of on-time jobs and the cost of using the machines. This scheduling problem is very important and frequent in industrial settings. It is herein solved using an exact approach that applies Benders decomposition to obtain tight upper and lower bounds and uses the bounds within a branch and bound. The computational investigation shows the efficacy of the approach in solving large instances. Most importantly, the proposed approach provides a new venue for solving large-scale scheduling problems.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2015.1033501 (text/html)
Access to full text is restricted to subscribers.

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:taf:tprsxx:v:53:y:2015:i:19:p:5977-5987

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2015.1033501

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().