Improving job-shop schedules through critical pairwise exchanges

International Journal of Production Research

Volumn 36, Issue 3, 1998, Pages 683-694

  Chu, C ^a,b   Proth, J M ^a,c   Wang, C ^a,d  

^a INRIA   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^c UNIVERSITY OF MARYLAND   (United States)

^d SHENYANG INSTITUTE OF AUTOMATION   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; OPTIMIZATION; SCHEDULING;

JOB-SHOP SCHEDULING;

JOB ANALYSIS;

EID: 0032022574     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075498193633     Document Type: Article

References (17)

1. Adams, J., Balas, E., and Zawack, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34 (3), 391-401.
2. Applegate, D., and Cook, W., 1991, A computational study of the job-shop scheduling instance. ORSA Journal on Computing, 3, 149-156.
3. Barker, J. R., and McMahon, G. B., 1985, Scheduling the general job-shop. Management Science, 31 (5), 594-598.
4. Brucker, P., Jurisch, B., and Sievers, B., 1994, A branch and bound algorithmfor the jobshop scheduling problem. Discrete Applied Mathematics, 49, 107-127.
5. Calier, J., and Pinson, E., 1989, An algorithm for solving the job-shop problem. Management Science, 35 (2), 164-176.
6. Day, J. E., and Hottenstein, M. L., 1970, Review of sequencing research. Naval Research Logistics Quarterly, 17, 11-38.
7. Gondran, M., and Minoux, M., 1979, Graphes et Algorithmes (Paris: Editions Eyrolles), pp. 41-44.
8. Grabot, B., and Geneste, L., 1994, Dispatching rules in scheduling: a fuzzy approach. International Journal of Production Research, 32 (4), pp. 903-915.
9. Lageweg, B. J., Lenstra, J. K., and Rinnoykan, A. H. G., 1977, Job shop scheduling by implicit enumeration. Management Science, 24 (4), pp. 441-450.
10. Lawrence, W., 1984, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, USA.
11. Mattfield, D. C., and Vaessens, R. J. M., 1995, OR-Library, http://mscmga.ms.ic.ac.uk/
12. MeCarthy, B. L., and Liu, J., 1993, Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. International Journal of Production Research, 31 (1), 59-79.
13. Muth, J. F., and Thompson, G. L. (eds), 1963, Industrial Scheduling (Englewood Cliffs, NJ: Prentice Hall).
14. Panwalkar, S. S., and Iskander, W., 1977, A survey of scheduling rules. Operation Research, 25 (1), 45-61.
15. Werner, F., and Winkler, A., 1995, Insertion technique for the heuristic solution of the job shop problem. Discrete Applied Mathematics, 58, 191-211.
16. Wu, H. H., and Li, R. K., 1995, A new rescheduling method for computer based scheduling systems. International Journal of Production Research, 33 (8), 2097-2110
17. Yamada, T., and Nakano, R., 1992, A genetic algorithm applicable to large-scale job-shop instances. In Parallel Instance Solving from Nature, 2, R. Manner and B. Manderick (eds) (Amsterdam: North-Holland-Elsevier), pp. 281-290.