List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility

European Journal of Operational Research

Volumn 247, Issue 2, 2015, Pages 421-440

  Birgin, E G ^a   Ferreira, J E ^a   Ronconi, D P ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Beam search; Flexible job shop; List scheduling; Makespan; Scheduling

Indexed keywords

DIRECTED GRAPHS; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

BEAM SEARCH; DIRECTED ACYCLIC GRAPH (DAG); FLEXIBLE JOB SHOPS; FLEXIBLE JOB-SHOP PROBLEM; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; LIST SCHEDULING ALGORITHMS; LIST-SCHEDULING; MAKESPAN;

JOB SHOP SCHEDULING;

EID: 84938744029     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2015.06.023     Document Type: Article

References (41)

1. Alvarez-Valdés R., Fuertes A., Tamarit J.M., Giménez G., and Ramos R. A heuristic to schedule flexible job-shop in a glass factory European Journal of Operational Research 165 2005 pp.525 534
2. Barnes J.W., and Chambers J.B. Flexible Job Shop Scheduling with tabu search, graduate program in operations research and industrial engineering Technical Report 1996 University of Texas, Austin
3. Birgin E.G., Feofiloff P., Fernandes C.G., de Melo E.L., Oshiro M.T.I., and Ronconi D.P. A MILP model for an extended version of the flexible job shop problem Optimization Letters 8 2014 pp.1417 1431
4. Brandimarte P. Routing and scheduling in a flexible job shop by tabu search Annals of Operations Research 41 1993 pp.157 183
5. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to algorithms 3rd ed. 2009 The MIT Press Cambridge, MA
6. Dauzère-Pérès S., and Paulli J. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search Annals of Operations Research 70 1997 pp.281 306
7. Fattahi P., Mehrabad M., and Jolai F. Mathematical modeling and heuristic approaches to flexible job shop scheduling problems Journal of Intelligent Manufacturing 18 2007 pp.331 342
8. Fulkerson D.R. Note on Dilworth's decomposition theorem for partially ordered sets Proceedings of the American Mathematical Society 7 1956 pp.701 702
9. Gan P.Y., and Lee K.S. Scheduling of flexible-sequenced process plans in a mould manufacturing shop International Journal of Advanced Manufacturing Technology 20 2002 pp.214 222
10. Garey M., Johnson D., and Sethi R. The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 1976 pp.117 129
11. Gutiérrez C., and García-Magariño I. Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem Knowledge-Based Systems 24 2011 pp.102 112
12. Ho N.B., Tai J.C., and Lai E.M.-K. An effective architecture for learning and evolving flexible job-shop schedules European Journal of Operational Research 179 2006 pp.316 333
13. Hurink J., Jurish B., and Thole M. Tabu search for the job shop scheduling problem with multi-purpose machines OR-Spektrum 15 1994 pp.205 215
14. Joseph O.A., and Sridharan R. Effects of routing flexibility, sequencing flexibility and scheduling decision rules on the performance of a flexible manufacturing system International Journal of Advanced Manufacturing Technology 56 2011 pp.291 306
15. Kacem I., Hammadi S., and Borne P. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic Mathematics and Computers in Simulation 60 2002 pp.245 276
16. Kim Y.-D. A backward approach in list scheduling algorithms for multi-machine tardiness problems Computers and Operations Research 22 1995 pp.307 319
17. Kim Y.K., Park K., and Ko J. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling Computers and Operations Research 30 2003 pp.1151 1171
18. Lee G.-C., Kim Y.-D., and Choi S.-W. Bottleneck-focused scheduling for a hybrid flowshop International Journal of Production Research 42 2004 pp.165 181
19. Lee S., Moon I., Bae H., and Kim J. Flexible job-shop scheduling problems with AND/OR precedence constraints International Journal of Production Research 50 2012 pp.1979 2001
20. Li J., Pan Q., and Liang Y. An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems Computers and Industrial Engineering 59 2010 pp.647 662
21. Lin G.Y.-J., and Solberg J.J. Effectiveness of flexible routing control International Journal of Flexible Manufacturing Systems 3 1991 pp.189 211
22. Mainieri G., and Ronconi D.P. New heuristics for total tardiness minimization in a flexible flowshop Optimization Letters 7 2013 pp.665 684
23. Manne A. On the job-shop scheduling problem Operations Research 8 1960 pp.219 223
24. Mastrolilli M., and Gambardella L.M. Effective neighbourhood functions for the flexible job shop problem Journal of Scheduling 3 2000 pp.3 20
25. Ow P.S., and Morton T.E. Filtered beam search in scheduling International Journal of Production Research 26 1988 pp.35 62
26. Özgüven C., ÖzbakIr L., and Yavuz Y. Mathematical models for job-shop scheduling problems with routing and process plan flexibility Applied Mathematical Modeling 34 2010 pp.1539 1548
27. Pezzella F., Morganti G., and Ciaschetti G. A genetic algorithm for the flexible job-shop scheduling problem Computers and Operations Research 35 2008 pp.3202 3212
28. Pinedo M. Scheduling: theory, algorithms, and systems third edition 2008 Springer New York, NY
29. Rachamadugu R., Nandkeolyar U., and Schriber T. Scheduling with sequencing flexibility Decision Sciences 24 1993 pp.315 342
30. Sabuncuoglu I., and Bayiz M. Job shop scheduling with beam search European Journal of Operational Research 118 1999 pp.390 412
31. Sabuncuoglu I., and Karabuk S. A beam search-based algorithm and evaluation of scheduling approaches for flexible manufacturing systems IIE Transaction 30 1998 pp.179 191
32. Shao X., Liu W., Liu Q., and Zhang C. Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem International Journal of Advanced manufacturing Technology 67 2013 pp.2885 2901
33. Shi-Jin W., Bing-Hai Z., and Li-Feng X. A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem International Journal of Production Research 46 2008 pp.3027 3058
34. Sörensen K. Metaheuristics - the metaphor exposed International Transactions in Operational Research 22 2015 pp.3 18
35. Tay J.C., and Ho N.B. Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems Computers and Industrial Engineering 54 2008 pp.453 473
36. Vilcot G., and Billaut J.-C. A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem European Journal of Operational Research 190 2008 pp.398 411
37. Yuan Y., and Xu H. An integrated search heuristic for large-scale flexible job shop scheduling problems Computers and Operations Research 40 2013 pp.2864 2877
38. Zeng J., Jackson S., Lin I.-J., Gustafson M., Hoarau E., and Mitchell R. On-demand digital print operations: a simulation based case study Technical Report 2010 Hewlett-Packard
39. Zhang G., Shao X., Li P., and Gao L. An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem Computers and Industrial Engineering 56 2009 pp.1309 1318
40. Printers National Environmental Assistance Center (PNEAC). Available at: http://www.pneac.org, accessed on February 9, (2015).
41. http://people.idsia.ch/~monaldo/fjspresults/fjsp-result.ps accessed on February 9. (2015).