Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

Cited 30 time in webofscience Cited 0 time in scopus
  • Hit : 356
  • Download : 0
This research focuses on the problem of scheduling jobs on a single machine that requires periodic maintenance with the objective of minimizing the number of tardy jobs. We present a two-phase heuristic algorithm in which an initial solution is obtained first with a method modified from Moore's algorithm for the problem without maintenance and then the solution is improved in the second phase. Performance of the proposed heuristic algorithm is evaluated through computational experiments on randomly generated problem instances and results show that the heuristic gives solutions close to those obtained from a commercial integer programming solver in much shorter time and works better than an existing heuristic algorithm in terms of the solution quality. (C) 2011 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2012-09
Language
English
Article Type
Article
Keywords

RELEASE TIME CONSTRAINTS; TOTAL COMPLETION-TIME; SEQUENCING ALGORITHM; LINEAR DETERIORATION; NONRESUMABLE JOBS; TOOL CHANGES; FLOW-TIME; PERFORMANCE; BREAKDOWN; MAKESPAN

Citation

COMPUTERS OPERATIONS RESEARCH, v.39, no.9, pp.2196 - 2205

ISSN
0305-0548
DOI
10.1016/j.cor.2011.11.002
URI
http://hdl.handle.net/10203/98853
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 30 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0