메뉴 건너뛰기




Volumn 42, Issue 9, 1996, Pages 1260-1276

Scheduling parallel manufacturing cells with resource flexibility

Author keywords

Flexible Resource Allocation; Production Scheduling; Sequencing

Indexed keywords


EID: 0001691215     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.42.9.1260     Document Type: Article
Times cited : (76)

References (23)
  • 1
    • 0023169183 scopus 로고
    • Scheduling on Machines with Variable Service Rates
    • Adiri, I. and Z. Yehudai, "Scheduling on Machines with Variable Service Rates," Computers and Oper. Res., 14 (1987), 289-297.
    • (1987) Computers and Oper. Res. , vol.14 , pp. 289-297
    • Adiri, I.1    Yehudai, Z.2
  • 4
    • 0005656375 scopus 로고
    • Selected Topics in Scheduling Theory
    • Blazewicz, J., "Selected Topics in Scheduling Theory," Ann. Discrete Math., 31 (1987), 1-60.
    • (1987) Ann. Discrete Math. , vol.31 , pp. 1-60
    • Blazewicz, J.1
  • 5
    • 0025474221 scopus 로고
    • A State-of-the-Art Review of Parallel-Machine Scheduling Research
    • Cheng, T. C. E. and C. C. S. Sin, "A State-of-the-Art Review of Parallel-Machine Scheduling Research," European J. Oper. Res., 47 (1990), 271-292.
    • (1990) European J. Oper. Res. , vol.47 , pp. 271-292
    • Cheng, T.C.E.1    Sin, C.C.S.2
  • 7
    • 0025478981 scopus 로고
    • A Multi-Objective Approach to Resource Allocation in Single Machine Scheduling
    • Daniels, R. L., "A Multi-Objective Approach to Resource Allocation in Single Machine Scheduling," European J. Oper. Res., 48 (1990), 226-241.
    • (1990) European J. Oper. Res. , vol.48 , pp. 226-241
    • Daniels, R.L.1
  • 9
    • 21144472862 scopus 로고
    • A Tabu-Search Heuristic for the Flexible-Resource Flow Shop Scheduling Problem
    • _ and J. B. Mazzola, "A Tabu-Search Heuristic for the Flexible-Resource Flow Shop Scheduling Problem," Annals Oper. Res., 41 (1993), 207-230.
    • (1993) Annals Oper. Res. , vol.41 , pp. 207-230
    • Mazzola, J.B.1
  • 10
    • 0028424243 scopus 로고
    • Flow Shop Scheduling with Resource Flexibility
    • _ and _, "Flow Shop Scheduling with Resource Flexibility," Oper. Res., 42 (1994), 504-522.
    • (1994) Oper. Res. , vol.42 , pp. 504-522
  • 11
    • 0024769314 scopus 로고
    • Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
    • _ and R. K. Sarin, "Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy," Oper. Res., 37 (1989), 981-984.
    • (1989) Oper. Res. , vol.37 , pp. 981-984
    • Sarin, R.K.1
  • 12
    • 0001627504 scopus 로고
    • Complexity Results for Multiprocessor Scheduling under Resource Constraints
    • Garey, M. R. and D. S. Johnson, "Complexity Results for Multiprocessor Scheduling under Resource Constraints," SIAM J. Computing, 4 (1975), 397-411.
    • (1975) SIAM J. Computing , vol.4 , pp. 397-411
    • Garey, M.R.1    Johnson, D.S.2
  • 13
    • 0025862665 scopus 로고
    • Heuristics for Scheduling Unrelated Parallel Machines
    • Hariri, A. M. A. and C. N. Potts, "Heuristics for Scheduling Unrelated Parallel Machines," Computers and Oper. Res., 18 (1991), 323-331.
    • (1991) Computers and Oper. Res. , vol.18 , pp. 323-331
    • Hariri, A.M.A.1    Potts, C.N.2
  • 17
    • 0026879950 scopus 로고
    • Single-Machine Sequencing with Controllable Processing Times
    • Panwalker, S. S. and R. Rajagopalan, "Single-Machine Sequencing with Controllable Processing Times," European J. Oper. Res., 59 (1992), 298-302.
    • (1992) European J. Oper. Res. , vol.59 , pp. 298-302
    • Panwalker, S.S.1    Rajagopalan, R.2
  • 18
    • 0000478729 scopus 로고
    • Solving Resource-Constrained Network Problems by Implicit Enumeration - Non-Preemptive Case
    • Schrage, L., "Solving Resource-Constrained Network Problems by Implicit Enumeration - Non-Preemptive Case," Oper. Res., 18 (1970), 263-278.
    • (1970) Oper. Res. , vol.18 , pp. 263-278
    • Schrage, L.1
  • 19
    • 0025413493 scopus 로고
    • Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
    • So, K. C., "Some Heuristics for Scheduling Jobs on Parallel Machines with Setups," Management Sci., 36 (1990), 467-475.
    • (1990) Management Sci. , vol.36 , pp. 467-475
    • So, K.C.1
  • 20
    • 0028383503 scopus 로고
    • Scheduling Multiple Variable-Speed Machines
    • Trick, M. A., "Scheduling Multiple Variable-Speed Machines," Oper. Res., 42 (1994), 234-248.
    • (1994) Oper. Res. , vol.42 , pp. 234-248
    • Trick, M.A.1
  • 21
    • 0020177273 scopus 로고
    • A Bicriterion Approach to Time Cost Trade-Offs in Sequencing
    • Van Wassenhove, L. N. and K. R. Baker, "A Bicriterion Approach to Time Cost Trade-Offs in Sequencing," European J. Oper. Res., 11 (1982), 48-54.
    • (1982) European J. Oper. Res. , vol.11 , pp. 48-54
    • Van Wassenhove, L.N.1    Baker, K.R.2
  • 22
    • 0019055358 scopus 로고
    • Two Single-Machine Sequencing Problems Involving Controllable Job Processing Times
    • Vickson, R. G., "Two Single-Machine Sequencing Problems Involving Controllable Job Processing Times," AIEE Trans., 12 (1980), 258-262.
    • (1980) AIEE Trans. , vol.12 , pp. 258-262
    • Vickson, R.G.1
  • 23
    • 0019058538 scopus 로고
    • Choosing the Job Sequence and Processing Times to Minimize Processing Plus Flow Cost on a Single Machine
    • _, "Choosing the Job Sequence and Processing Times to Minimize Processing Plus Flow Cost on a Single Machine," Oper. Res., 28 (1980), 1155-1167.
    • (1980) Oper. Res. , vol.28 , pp. 1155-1167


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