1 |
Armentano, V.A. and Scrich, C.R., Tabu search for minimizing total tardiness in a job shop, International Journal of Production Economics, 2000, Vol. 63, No. 2, pp. 131-140.
DOI
|
2 |
Bang, J.-Y., Two-Level Hierarchical Production Planning for a Semiconductor Probing Facility, Journal of Society of Korea Industrial and Systems Engineering, 2015, Vol. 38, No. 4, pp. 159-167.
DOI
|
3 |
Braune, R., Zapfel, G., and Affenzeller, M., Enhancing local search algorithms for solving job shops with minsum objectives by approximate move evaluation, Journal of Scheduling, 2013, Vol. 16, No. 5, pp. 495-518.
DOI
|
4 |
Bulbul, K., A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, Computers and operations Research, 2011, Vol. 38, No. 6, pp. 967-983.
DOI
|
5 |
Chaudhry, I.A. and Khan, A.A., A research survey : review of flexible job shop scheduling techniques, International Transactions in Operational Research, 2016, Vol. 23, No. 3, pp. 551-591.
DOI
|
6 |
de Bontridder, K.M.J., Minimizing total weighted tardiness in a generalized job shop, Journal of Scheduling, 2005, Vol. 8, No. 6, pp. 479-496.
DOI
|
7 |
Essafi, I., Mati, Y., and Dauzere-Peres, S., A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, Computers and Operations Research, 2008, Vol. 35, No. 8, pp. 2599-2616.
DOI
|
8 |
Mattfeld, D.C. and Bierwirth, C., An efficient genetic algorithm for job shop scheduling with tardiness objectives, European Journal of Operational Research, 2004, Vol. 155, No. 3, pp. 616-630.
DOI
|
9 |
Park, K.M. and Jeong, S.J., A study on the improvement of work flow and productivity in complex manufacturing line by employing the effective process control methods, Journal of the Korea Academia-Industrial Cooperation Society, 2016, Vol. 17, No. 5 pp. 305-315.
DOI
|
10 |
Pinedo, M.L. and Singer, M., A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop, Naval Research Logistics, 1999, Vol. 46, No. 1, pp. 1-17.
DOI
|
11 |
Singer, M. and Pinedo, M.L., Computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops, IIE Transactions, 1998, Vol. 30, pp. 109-119.
DOI
|
12 |
Vepsalainen, A.P.J. and Morton, T.E., Priority rules for job shops with weighted tardiness costs, Management Science, 1987, Vol. 33, No. 8, pp. 1035-1047.
DOI
|
13 |
Zhang, R. and Wu, C., A neighbourhood property for the ob shop scheduling problem with application to hybrid particle swarm optimization, IMA Journal of Management Mathematics, 2013, Vol. 24, No. 1, pp. 111-134.
DOI
|
14 |
Zhang, R., Song, S., and Wu, C., A hybrid artificial bee colony algorithm for the job shop scheduling problem, International Journal of Production Economics, 2013, Vol. 141, No. 1, pp. 167-178.
DOI
|
15 |
Zhang, R. and Wu, C., A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm, Journal of Applied Mathematics, 2012, Vol. 2012, pp. 1-17.
|
16 |
Zhang, R. and Wu, C., A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, Computers and Operations Research, 2011, Vol. 38, No. 5, pp. 854-867.
DOI
|
17 |
Jayamohan, M.S. and Rajendran, C., New dispatching rules for job shop scheduling : A step forward, International Journal of Production Research, 2000, Vol. 38, No. 3, pp. 563-586.
DOI
|