Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed

This paper considers two single-machine scheduling problems with outsourcing allowed where each job can be either processed on an in-house single-machine or outsourced. They include the problem of minimizing maximum Idleness and outsourcing costs, and that of minimizing total tardiness and outsourcing costs. Outsourcing is commonly required as a way to improve productivity in various companies including electronics industries and motor industries. The objective is to minimize the weighted sum of the outsourcing cost and the scheduling measure represented by either one of maximum lateness and total tardiness, subject to outsourcing budget. It is proved that the problem is NP-hard. Some solution properties are characterized to derive heuristic algorithms, and also a branch-and-bound algorithm. Numerical experiments are conducted to evaluate performance of the derived algorithms. (c) 2007 Elsevier B.V. All rights reserved.
Publisher
Elsevier Science Bv
Issue Date
2008-05
Language
ENG
Keywords

TOTAL TARDINESS

Citation

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.186, no.3, pp.931 - 952

ISSN
0377-2217
DOI
10.1016/j.ejor.2007.02.015
URI
http://hdl.handle.net/10203/87744
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 149
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 25 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0