Maximizing total job value on a single machine with job selection

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 532
  • Download : 0
This paper describes a single-machine scheduling problem of maximizing total job value with a machine availability constraint. The value of each job decreases over time in a stepwise fashion. Several solution properties of the problem are developed. Based on the properties, a branch-and-bound algorithm and a heuristic algorithm are derived. These algorithms are evaluated in the computational study, and the results show that the heuristic algorithm provides effective solutions within short computation times.
Publisher
PALGRAVE MACMILLAN LTD
Issue Date
2017-09
Language
English
Article Type
Article
Keywords

TOTAL NET REVENUE; ORDER ACCEPTANCE; REJECTION; TARDINESS; TIME

Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.68, no.9, pp.998 - 1005

ISSN
0160-5682
DOI
10.1057/s41274-017-0238-z
URI
http://hdl.handle.net/10203/225806
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 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0