{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":11,"n_cols":5,"rows_kept":11,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[7,2,7,3],[8,2,8,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910674029503321"]
[null,null,"Titolo",null,"Exact and Heuristic Scheduling Algorithms / / edited by Frank Werner, Larysa Burtseva, Yuri Sotskov"]
[null,null,"Pubbl/distr/stampa",null,"Basel : , : MDPI - Multidisciplinary Digital Publishing Institute, , 2020"]
[null,null,"Descrizione fisica",null,"1 online resource (200 pages)"]
[null,null,"Disciplina",null,"004.24"]
[null,null,"Soggetti",null,"Computer capacity - Management"]
[{"$nulls":4},"Computer capacity - Planning"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Sommario/riassunto","This edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others."]