Parallel machine scheduling considering a job-splitting property

This paper focuses on the problem of scheduling jobs on parallel machines considering a job-splitting property. In this problem, it is assumed that a job can be split into a discrete number of subjobs and they are processed on parallel machines independently. A two-phase heuristic algorithm is suggested for the problem with the objective of minimizing total tardiness. In the first phase, an initial sequence is constructed by an existing heuristic method for the parallel-machine scheduling problem. In the second phase, each job is split into subjobs considering possible results of the split, and then jobs and subjobs are rescheduled on the machines using a certain method. To evaluate performance of the suggested algorithm, computational experiments are performed on randomly generated test problems. Results of the experiments show that the suggested algorithm performs better than an existing one.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2004-11
Language
ENG
Keywords

TARDINESS PROBLEM; BACKWARD APPROACH; HEURISTICS; ALGORITHMS

Citation

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.42, pp.4531 - 4546

ISSN
0020-7543
DOI
10.1080/00207540410001720745
URI
http://hdl.handle.net/10203/7746
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 481
  • Download : 2
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 21 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0