A hybrid two-stage flowshop scheduling problem

Asia-Pacific Journal of Operational Research

Volumn 24, Issue 1, 2007, Pages 45-56

  He, Longmin ^a   Sun, Shijie ^a   Luo, Runzi ^b  

^a SHANGHAI UNIVERSITY   (China)

^b NANCHANG UNIVERSITY   (China)

Author keywords

Batch processor; Dedicated machines; Flexible flowshop; Scheduling

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; PRODUCTION ENGINEERING; SCHEDULING;

APPROXIMATION ALGORITHM; BATCH PROCESSORS; DEDICATED MACHINES; FLEXIBLE FLOWSHOP;

RESOURCE ALLOCATION;

EID: 33947104553     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595907001036     Document Type: Article

References (15)

1. Ahmadi, JH, RH Ahmadi, S Dasu and CS Tang (1992). Batching and scheduling jobs on batch and discrete processors. Operations Research, 40, 750-763.
2. Garey, MR, DS Johnson and RR Sethi (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117-129.
3. Hariri, AMA and CN Potts (1997). A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research, 103, 547-556.
4. Johnson, SM (1954). Optimal two- and three-stage production scheduled with setup times included. Naval Research Logistics, 1, 61-68.
5. Lee, CY, R Uzsoy and LA Martin-Verga (1992). Efficient algorithms for scheduling semi-conductor burn-in operation. Operations Research, 40, 764-775.
6. Lee, CY, TCE Cheng and BMT Lin (1993). Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science, 39, 616-625.
7. Lin, BMT (1999). The strong NP-hardness of two-stage flowshop scheduling problem with a common second-stage machine. Computers and Operations Research, 26, 695-698.
8. Liu, SQ and HL Ong (2002). A comparative study of algorithms for the flowshop scheduling problem. Asia-Pacific Journal of Operational Research, 19(2), 205-222.
9. Mathirajan, M, V Chandru and KN Krishnaswamy (2001). Modified heuristic algorithms for scheduling multiple batch processors with incompatible job families. Asia-Pacific Journal of Operational Research, 18(1), 89-102.
10. Oǧuz, C, BMT Lin and TCE Cheng (1997). Two-stage flowshop scheduling with a common second-stage machine. Computers and Operations Research, 24, 1169-1174.
11. Potts, CN, SV Sevastjanov, VA Strusevich, LN van Wassenhove and CM Zwaneveld (1995). The two-stage assembly scheduling problem: complexity and approximation. Operations Research, 43, 346-355.
12. Potts, CN, VA Struserich and T Tautenhahn (2001). Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling, 4, 25-51.
13. Sun, X, K Morizawa and H Nagasawa (2003). Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling. European Journal of Operational Research, 146, 498-516.
14. Sung, CS and YI Choung (2000). Minimizing makespan on a single burn-in oven in semi-conductor manufacturing. European Journal of Operational Research, 120, 559-574.
15. Sung, CS, YH Kim and SH Yoon (2000). A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines. European Journal of Operational Research, 121, 179-192.