Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Cited 20 time in webofscience Cited 0 time in scopus
  • Hit : 277
  • Download : 0
This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while there is a single batch-processing machine at the second stage. Ready times of the jobs (at the first stage) may be different, and a given product-mix ratio of job types should be kept in each batch at the second stage. We present three types of heuristic algorithms: forward scheduling algorithms, backward scheduling algorithms, and iterative algorithms. To evaluate performance of the suggested algorithms, a series of computational experiments are performed on randomly generated test problems and results are reported.
Publisher
SPRINGER
Issue Date
2009-02
Language
English
Article Type
Article
Keywords

BATCH-PROCESSING MACHINE; MINIMIZING TOTAL TARDINESS; PARALLEL MACHINES; COMPLETION-TIME; GENETIC ALGORITHM; BACKWARD APPROACH; BOUND ALGORITHM; MAKESPAN; STAGE; SHOP

Citation

JOURNAL OF HEURISTICS, v.15, no.1, pp.19 - 42

ISSN
1381-1231
DOI
10.1007/s10732-007-9061-z
URI
http://hdl.handle.net/10203/97098
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 20 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0