Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints

Cited 9 time in webofscience Cited 0 time in scopus
  • Hit : 417
  • Download : 0
This paper considers a deterministic scheduling problem where multiple jobs With s-precedence relations are processed on multiple identical parallel machines. The objective is to minimize the total completion time. The s-precedence relation between two jobs i and j represents the situation where job j is constrained from processing until job i starts processing, which is different from the standard definition of a precedence relation where j cannot start until i completes. The s-precedence relation has wide applicability in the real world such as first-come-first-served processing systems. The problem is shown to be intractable, for which a heuristic procedure is derived. Numerical experiments are conducted to show that the derived heuristic provides effective solutions. (C) 2007 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2009
Language
English
Article Type
Article
Keywords

MEAN FLOW TIME; SINGLE-MACHINE; BOUNDS; ALGORITHMS; ANOMALIES; JOBS

Citation

COMPUTERS & OPERATIONS RESEARCH, v.36, no.3, pp.698 - 710

ISSN
0305-0548
DOI
10.1016/j.cor.2007.10.025
URI
http://hdl.handle.net/10203/93755
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 9 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0