메뉴 건너뛰기




Volumn 37, Issue 8, 1999, Pages 1697-1715

Job shop scheduling with a non-regular objective: A comparison of neighbourhood structures based on a sequencing/timing decomposition

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COST EFFECTIVENESS; HEURISTIC METHODS; INVENTORY CONTROL; PROBLEM SOLVING; PROCESS CONTROL; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

EID: 0032632653     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499190969     Document Type: Article
Times cited : (11)

References (24)
  • 1
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • Adams, J., Balas, E. and Zawack, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
    • (1988) Management Science , vol.34 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 2
    • 0026923121 scopus 로고
    • Minimizing job idleness in deadline constrained environments
    • Ahmadi, R. H. and Bagchi, U., 1992, Minimizing job idleness in deadline constrained environments. Operations Research, 40, 972-985.
    • (1992) Operations Research , vol.40 , pp. 972-985
    • Ahmadi, R.H.1    Bagchi, U.2
  • 4
    • 0025211593 scopus 로고
    • Sequencing with earliness and tardiness penalties: A review
    • Bakeh, K. R. and Scuddeh, G. D., 1990, Sequencing with earliness and tardiness penalties: a review. Operations Research, 38, 22-36.
    • (1990) Operations Research , vol.38 , pp. 22-36
    • Bakeh, K.R.1    Scuddeh, G.D.2
  • 5
    • 0002381223 scopus 로고
    • Machine sequencing via disjunctive graphs: An implicit enumeration algorithm
    • Balas, E., 1969, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research, 17, 941-957.
    • (1969) Operations Research , vol.17 , pp. 941-957
    • Balas, E.1
  • 6
    • 34250073986 scopus 로고
    • A tabu search experience in production scheduling
    • Bahnes, J. W. and Laguna, M., 1993, A tabu search experience in production scheduling. Annals of Operations Research, 41, 141-156.
    • (1993) Annals of Operations Research , vol.41 , pp. 141-156
    • Bahnes, J.W.1    Laguna, M.2
  • 7
    • 38249011351 scopus 로고
    • Neighbourhood search-based optimization algorithms for production scheduling: A survey
    • Bhandimahte, P., 1992, Neighbourhood search-based optimization algorithms for production scheduling: a survey. Computer-Integrated Manufacturing Systems, 5, 167-176.
    • (1992) Computer-Integrated Manufacturing Systems , vol.5 , pp. 167-176
    • Bhandimahte, P.1
  • 8
    • 34250084648 scopus 로고
    • Routing and scheduling in a flexible job shop by tabu search
    • Bhandimahte, P., 1993, Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41, 157-183.
    • (1993) Annals of Operations Research , vol.41 , pp. 157-183
    • Bhandimahte, P.1
  • 10
    • 34250074609 scopus 로고
    • Applying tabu-search to the job-shop scheduling problem
    • Dell’Amico, M. and Thubian, M., 1993, Applying tabu-search to the job-shop scheduling problem. Annals of Operations Research, 41, 231-252.
    • (1993) Annals of Operations Research , vol.41 , pp. 231-252
    • Dell’amico, M.1    Thubian, M.2
  • 13
  • 16
    • 0000245614 scopus 로고
    • The single machine early/tardy problem
    • Ow, P. S. and Morton, T. E., 1989, The single machine early/tardy problem. Management Science, 35, 177-191.
    • (1989) Management Science , vol.35 , pp. 177-191
    • Ow, P.S.1    Morton, T.E.2
  • 17
    • 84974861854 scopus 로고
    • Integrating scheduling with batching and lot sizing: A review of algorithms and complexity
    • Potts, C. N. and Van Wassenhove, L. N., 1992, Integrating scheduling with batching and lot sizing: a review of algorithms and complexity. Journal of the Operational Research Society, 43, 395-406.
    • (1992) Journal of the Operational Research Society , vol.43 , pp. 395-406
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 18
    • 0029288392 scopus 로고
    • Input control in job shops
    • Raman, N., 1995, Input control in job shops. IIE Transactions, 27, 201-209.
    • (1995) IIE Transactions , vol.27 , pp. 201-209
    • Raman, N.1
  • 19
    • 84987041490 scopus 로고
    • A comparison of order-release and dispatch rules for the dynamic weighted early/tardy problem
    • Rohleder, T. R. and Scudder, G., 1993, A comparison of order-release and dispatch rules for the dynamic weighted early/tardy problem. Production and Operations Management, 2, 221-238.
    • (1993) Production and Operations Management , vol.2 , pp. 221-238
    • Rohleder, T.R.1    Scudder, G.2
  • 20
    • 0009395266 scopus 로고
    • Focused simulated annealing search: An application to job-shop scheduling
    • Sadeh, N. and Nakakuki, Y., 1995, Focused simulated annealing search: an application to job-shop scheduling. Annals of Operations Research, 60.
    • (1995) Annals of Operations Research , vol.60
    • Sadeh, N.1    Nakakuki, Y.2
  • 21
    • 0028406904 scopus 로고
    • A dynamic job shop scheduling framework: A backward approach
    • Sun, D. and Lin, L., 1994, A dynamic job shop scheduling framework: a backward approach. International Journal of Production Research, 32, 967-985.
    • (1994) International Journal of Production Research , vol.32 , pp. 967-985
    • Sun, D.1    Lin, L.2
  • 22
    • 84977334714 scopus 로고
    • Optimal timing schedules in earliness-tardi-ness single machine sequencing
    • Szwarc, W. and Mukhopadhyay, S. K., 1995, Optimal timing schedules in earliness-tardi-ness single machine sequencing. Naval Research Logistics, 42, 1109-1114.
    • (1995) Naval Research Logistics , vol.42 , pp. 1109-1114
    • Szwarc, W.1    Mukhopadhyay, S.K.2
  • 23
    • 0023399009 scopus 로고
    • Priority rules for job shops with weighted tardiness costs
    • Vepsalainen, A. P. J. and Morton, T. E., 1987, Priority rules for job shops with weighted tardiness costs. Management Science, 33, 1035-1047.
    • (1987) Management Science , vol.33 , pp. 1035-1047
    • Vepsalainen, A.P.J.1    Morton, T.E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.