Flexible job shop scheduling with overlapping in operations

Applied Mathematical Modelling

Volumn 33, Issue 7, 2009, Pages 3076-3087

  Fattahi, Parviz ^a   Jolai, Fariborz ^b   Arkat, Jamal ^c  

^a BU ALI SINA UNIVERSITY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

^c UNIVERSITY OF KURDISTAN   (Iran)

Author keywords

Flexible job shop; Hierarchical approach; Overlapping; Scheduling; Simulated annealing

Indexed keywords

ANNEALING; BRANCH AND BOUND METHOD; COMPUTATIONAL EFFICIENCY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

BRANCH-AND-BOUND METHODS; COMPUTATIONAL RESULTS; CUSTOMER DEMANDS; FACTORY CONDITIONS; FLEXIBLE JOB SHOP; FLEXIBLE JOB-SHOP SCHEDULING; FLEXIBLE JOB-SHOP SCHEDULING PROBLEMS; HIERARCHICAL APPROACH; LARGE SIZES; MAKESPAN; MIXED-INTEGER LINEAR PROGRAMMING; NEW APPROACHES; NP-HARD CLASS; ONE MACHINES; OPTIMAL SOLUTIONS; OPTIMIZATION TECHNIQUES; OVERLAPPING; PETROCHEMICAL INDUSTRIES; PRACTICAL ISSUES; PROBLEM INSTANCES; SA ALGORITHMS; SIMULATED ANNEALING ALGORITHMS; STRUCTURAL CONSTRAINTS;

SIMULATED ANNEALING;

EID: 61449237375     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2008.10.029     Document Type: Article

References (11)

1. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Math. Operat. Res. 1 (1976) 117-129
2. Xia W., and Wu Z. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Indust. Eng. 48 (2005) 409-425
3. Fattahi P., Saidi M., and Jolai F. Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 18 (2007) 331-342
4. Alvarez-Valdes A., et al. A heuristic to schedule flexible job shop in a glass factory. Euro. J. Operat. Res. 165 (2005) 525-534
5. Bruker P., and Schlie R. Job shop scheduling with multi-purpose machines. Computing 45 (1990) 369-375
6. Brandimarte P. Routing and scheduling in a flexible job shop by taboo search. Ann. Operat. Res. 41 (1993) 157-183
7. Saidi M., and Fattahi P. Flexible job shop scheduling with tabu search algorithm. Int. J. Adv. Manuf. Technol. 32 (2007) 563-570
8. Kacem I., Hammadi S., and Borne P. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simulat. 60 (2002) 245-276
9. Hurink E., Jurisch B., and Thole M. Tabu search for the job shop scheduling problem with multi-purpose machines. Operat. Res. Spekt. 15 (1994) 205-215
10. Dauzere-Peres S., and Paulli J. An integrated approach for modeling and solving the general multiprocessor job shop scheduling problem using tabu search. Ann. Operat. Res. 70 (1997) 281-306
11. Mastrololli M., and Gambardella L.M. Effective neighborhood functions for the flexible job shop problem. J. Schedul. 3 1 (2002) 3-20