A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint
Ju-Yong Lee and
Yeong-Dae Kim
Additional contact information
Ju-Yong Lee: Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea
Yeong-Dae Kim: Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea
Journal of the Operational Research Society, 2015, vol. 66, issue 9, 1542-1554
Abstract:
This research focuses on the problem of scheduling jobs on two identical parallel machines that are not continuously available with the objective of minimizing total tardiness. After processing a given number of jobs, each machine requires a preventive maintenance task, during which the machine cannot process jobs. We present dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. Performance of the algorithm is evaluated through a series of computational experiments on randomly generated instances and results are reported.
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v66/n9/pdf/jors2014122a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v66/n9/full/jors2014122a.html Link to full text HTML (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:pal:jorsoc:v:66:y:2015:i:9:p:1542-1554
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook
More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().