A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 309
  • Download : 0
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.
Publisher
PALGRAVE MACMILLAN LTD
Issue Date
2015-09
Language
English
Article Type
Article
Keywords

TOTAL COMPLETION-TIME; SINGLE-MACHINE; PERIODIC MAINTENANCE; MAKESPAN MINIMIZATION; TOOL CHANGES; TARDY JOBS; FLOW-TIME; PERFORMANCE; HEURISTICS; BREAKDOWN

Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.66, no.9, pp.1542 - 1554

ISSN
0160-5682
DOI
10.1057/jors.2014.122
URI
http://hdl.handle.net/10203/203933
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0