Algorithms for a two-machine flowshop problem with jobs of two classes

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 86
  • Download : 0
We consider a problem of scheduling jobs of two classes of urgencies in a two-machine flowshop with the objective of minimizing total tardiness of one class for urgent jobs and the maximum completion time of the other class for non-urgent jobs. Urgent jobs are an important consideration in the real manufacturing systems, but it has not been studied due to the difficulty of the problem. In this research, a branch-and-bound (B&B) algorithm is proposed through developing lower bounds, dominance properties, and heuristic algorithms for obtaining an initial feasible solution. To evaluate the performance of the proposed algorithms, computational experiments on randomly generated instances are performed. Results of the experiments show that the suggested B&B algorithm can solve problems with up to 20 jobs in a reasonable amount of CPU time.
Publisher
WILEY
Issue Date
2020-11
Language
English
Article Type
Article
Citation

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, v.27, no.6, pp.3123 - 3143

ISSN
0969-6016
DOI
10.1111/itor.12530
URI
http://hdl.handle.net/10203/275077
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