Search Heuristics for a Parallel Machine Scheduling Problem with Ready Times and Due Dates

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 548
  • Download : 1
We consider a problem of scheduling orders on identical parallel machines. An order can be released after the ready time and must be completed before the due date. An order is split into some batches and a batch is processed one of the parallel machines. The objective of the scheduling problem is to minimize the work-in-process holding costs of orders and the inventory holding costs of batches. We suggest two local search heuristics, simulated annealing and taboo search algorithms, to solve the problem. The performance of the suggested algorithms is reported through the computational tests on randomly generated test problems.
Publisher
Elsevier
Issue Date
1997
Keywords

Parallel machine scheduling; simulated annealing; taboo search

Citation

Computer and Industrial Engineering, vol.33, no.3-4, pp.793-796

ISSN
0360-8352
DOI
10.1016/S0360-8352(97)00255-6
URI
http://hdl.handle.net/10203/7492
Appears in Collection
IE-Conference Papers(학술회의논문)

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0