Scheduling complex job shops using disjunctive graphs: A cycle elimination procedure

International Journal of Production Research

Volumn 41, Issue 5, 2003, Pages 981-994

  Mason, Scott J ^a   Oey, Kasin ^a  

^a 3202 Bell Engineering Center   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; HEURISTIC METHODS; JOB ANALYSIS; MATHEMATICAL MODELS; SEMICONDUCTOR DEVICE MANUFACTURE;

JOB SHOPS;

PRODUCTION ENGINEERING;

EID: 0242364617     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540210163009     Document Type: Article

References (21)

1. ADAMS, J., BALAS, E. and ZAWACK, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
2. AHMADI, J. H., AHMADI, R. H., DASU, S. and TANG, C. S., 1992, Batching and scheduling job shop on batch and discrete processors. Operations Research, 40, 750-763.
3. BALAS, E., LENSTRA, J. K. and VAZACOPOULOS, A., 1995, The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science, 41, 94-109.
4. CHANDRU, V., LEE, C. Y. and UZSOY, R., 1993, Minimizing total completion time on batch processing machines. International Journal of Production Research, 31, 2097-2121.
5. CIGOLINI, R., COMI, A., MICHELETTI, A., PERONA, M. and PORTIOLI, A., 1999, Implementing new dispatching rules at SGS-Thomson microelectronics. Production Planning & Control, 10(1), 97-106.
6. EL ADL, M. K., RODRIGUEZ, A. A. and TSAKALIS, K. S., 1996, Hierarchical modeling and control of reentrant semiconductor manufacturing facilities. Proceedings of the 35th Conference on Decision and Control, Kobe, Japan.
7. HOLTSCLAW, H. H. and UZSOY, R., 1996, Machine criticality measures and subproblem solution procedures in shifting bottleneck methods: a computational study. Journal of Operational Research Society, 47, 666-677.
8. HWANG, H. and SUN, J. U., 1997, Production sequencing problem with reentrant work flows and sequence dependent setup times. Computers & Industrial Engineering, 33, 773-776.
9. LENSTRA, J. K., RINNOOY KAN, A. H. G. and BRUCKER, P., 1977, Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
10. KUBIAK, W., Lou, S. X. C. and WANG, Y., 1996, Mean flow time minimization in reentrant job shops with a hub. Operations Research, 44, 764-776.
11. LEE, C. Y. and UZSOY, R., 1999, Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219-236.
12. MASON, S. J. and FOWLER, J. W., 2000, Maximizing delivery performance in semiconductor wafer fabs. In J. A. Joines, R. R. Barton, K. Kang and P. A. Fishwick (eds), Proceedings of the 2000 Winter Simulation Conference, pp. 1458-1463.
13. MASON, S. J., FOWLER, J. W. and CARLYLE, W. M., 2002a, A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling, 5(3), 247-262.
14. MASON, S. J., FOWLER, J. W., CARLYLE, W. M. and MONTGOMERY, D. C., 2002b, A comparison of tardiness minimization methodologies for complex job shops. European Journal of Operational Research, submitted.
15. MASON, S. J., SKINNER, G., Qu, P., JIN, S., WESSELS, C., PFUND, M., FOWLER, J. W., CARLYLE, W. M. and KIM, B., 2002c, Scheduling and rescheduling methodologies for wafer fabs. 12th International Flexible Automation and Intelligent Manufacturing Conference, Dresden, Germany, pp. 1464-1471.
16. NOSE, K., HIRAMATSU, A. and KONISHI, M., 1999, Using genetic algorithm for job-shop scheduling problems with reentrant product flows. ETFA Proceedings of the 1999 7th IEEE International Conference on Emerging Technologies and Factory Automation.
17. PINEDO, M., 2002, Scheduling: Theory, Algorithms, and Systems, 2nd edn (New Jersey: Prentice-Hall).
18. PINEDO, M. L. and SINGER, M., 1999, A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46, 1-17.
19. ROOBEEK, F., 1997, A better choice - a fuzzy logic based lot sequencing decision support system for operators in a job shop fab with reentrant process flows. Proceedings of the 1997 IEEE International Symposium on Semiconductor on Manufacturing Conference.
20. UZSOY, R., 1995, Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33, 2685-2708.
21. UZSOY, R., LEE, C. Y. and MARTIN-VEGA, L. A., 1992, A review of production planning and scheduling models in the semiconductor industry part 1: system characteristics, performance evaluation and production planning. IIE Transactions, 24, 47-60.