Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints

Journal of Intelligent Manufacturing

Volumn 23, Issue 6, 2012, Pages 2271-2280

  Wang, I Lin ^a   Yang, Taho ^a   Chang, Yu Bang ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Dispatching; Flow shop with multiple processors; Heuristic algorithm; Makespan; Mixed integer programming; Scheduling

Indexed keywords

COMPUTATIONAL EXPERIMENT; DISPATCHING; DISPATCHING RULES; FIRST-IN-FIRST-OUT; FLOW SHOP WITH MULTIPLE PROCESSORS; HEURISTIC APPROACH; LOCAL SEARCH HEURISTICS; MACHINE ELIGIBILITY CONSTRAINT; MAKESPAN; MIXED INTEGER PROGRAMMING; PARALLEL BATCH; RELEASE TIME; REOPTIMIZATION; SCHEDULING PROBLEM; SEMICONDUCTOR MANUFACTURING INDUSTRY; TWO-STAGE HYBRID FLOW SHOP;

HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; MACHINE SHOP PRACTICE; PARALLEL PROCESSING SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS; SEMICONDUCTOR DEVICE MANUFACTURE;

PROBLEM SOLVING;

EID: 84870869927     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-011-0571-z     Document Type: Article

References (14)

1. Bellanger, A., & Oulamara, A. (2009). Scheduling hybrid flowshop with parallel batching machines and compatibilities. Computers and Operations Research, 36, 982-1992.
2. Centeno, G., & Armacost, R. L. (2004). Minimizing makespan on parallel machines with release time and machine eligibility restrictions. International Journal of Production Research, 42, 1243-1256.
3. Dobson, G., & Nambimadom, R. S. (2001). The batch loading and scheduling problem. Operations Research, 49, 52-65.
4. Grangeon, N., Tanguy, A., & Tchernev, N. (1999). Generic simulation model for hybrid flow-shop. Computers and Industrial Engineering, 37, 207-210.
5. Hung, Y. F. (1998). Scheduling of mask shop E-beam writers. IEEE Transactions on Semiconductor Manufacturing, 11, 165-172.
6. Hunsucker, J. L., & Shah, J. R. (1994). Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment. European Journal of Operational Research, 72, 102-114.
7. Kashan, A. H., Karimi, B., & Jenabi, M. (2008). A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Computers and Operations Research, 35, 1084-1098.
8. Kuo, Y., Yang, T., Peters, B. A., & Chang, I. (2007). Simulation metamodel development using uniform design and neural networks for automated material handling systems in semiconductor wafer fabrication. Simulation Modeling Practice and Theory, 15, 1002-1015.
9. Li, C. L., & Lee, C. Y. (1997). Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research, 96, 564-569.
10. Malve, S., & Uzsoy, R. (2007). A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families. Computer and Operations Research, 34, 3016-3028.
11. Mathirajan, M., & Sivakumar, A. I. (2006). A literature review, classification and simple meta-Analysis on scheduling of batch processors in semiconductor. International Journal of Advanced Manufacturing Technology, 29, 990-1001.
12. Petroni, A., & Rizzi, A. (2002). A fuzzy logic based methodology to rank shop floor dispatch rules. International Journal of Production Economics, 76, 99-108.
13. Potts, C. N. & Kovalyov M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228-249.
14. Uzsoy, R., Church, L. K., & Ovacik, I. M. (1992). Dispatching rules for semiconductor testing operations: A computational study. IEEE/CHMT International Electronic Manufacturing Technology Symposium (pp. 272-276).