A MILP model for an extended version of the Flexible Job Shop Problem

Optimization Letters

Volumn 8, Issue 4, 2014, Pages 1417-1431

  Birgin, Ernesto G ^a   Feofiloff, Paulo ^a   Fernandes, Cristina G ^a   de Melo, Everton L ^a   Oshiro, Marcio T I ^a   Ronconi, Débora P ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Flexible Job Shop Problem; MIP models; Scheduling

Indexed keywords

DIRECTED GRAPHS; INTEGER PROGRAMMING; SCHEDULING;

DIRECTED ACYCLIC GRAPH (DAG); EXTENDED VERSIONS; FLEXIBLE JOB-SHOP PROBLEM; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; LINEAR ORDER; MIP MODELS; NUMERICAL EXPERIMENTS; PRINTING INDUSTRY;

JOB SHOP SCHEDULING;

EID: 84897440720     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-013-0669-7     Document Type: Article

References (13)

1. Alvarez-Valdés, R., Fuertes, A., Tamarit, J. M., Giménez, G., Ramos, R.: A heuristic to schedule flexible job-shop in a glass factory. Eur. J. Oper. Res. 165(2), 525-534 (2005).
2. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157-183 (1993).
3. Chan, F. T. S., Wong, T. C., Chan, L. Y.: Flexible job-shop scheduling problem under resource constraints. Int. J. Prod. Res. 44(11), 2071-2089 (2006).
4. Fattahi, P., Mehrabad, M., Jolai, F.: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 18, 331-342 (2007).
5. Gutiérrez, C., García-Magariño, I.: Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem. Knowl. Sys. 24(1), 102-112 (2011).
6. Garey, M., Johnson, D., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117-129 (1976).
7. Lawler, E., Lenstra, J., Rinnooy Kan, A., Shmoys, D.: Sequencing and scheduling: algorithms and complexity. In: Rinnooy Kan, A. H. G., Graves, S. C., Zipkin, P. H. (eds.) Logistics of Production and Inventory, volume 4, Chapter 9, pp. 445-522. Elsevier, Amsterdam (1993).
8. Manne, A.: On the job-shop scheduling problem. Oper. Res. 8, 219-223 (1960).
9. Mishra, P. K., Pandey, P. C.: Simulation modeling of batch job shop type flexible manufacturing systems. J. Mech. Work. Technol. 20, 441-450 (1989).
10. Özgüven, C., Özbaki{dotless}r, L., Yavuz, Y.: Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl. Math. Model. 34, 1539-1548 (2010).
11. Vilcot, G., Billaut, J.-C.: A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. Eur. J. Oper. Res. 190(2), 398-411 (2008).
12. Zeng, J., Jackson, S., Lin, I.-J., Gustafson, M., Hoarau, E., Mitchell, R.: On-demand digital print operations: A simulation based case study. Technical report, Hewlett-Packard (2010).
13. Zhang, G., Shao, X., Li, P., Gao, L.: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 56(4), 1309-1318 (2009).