Exact and Heuristic Scheduling Algorithms
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...
Đã lưu trong:
| Những tác giả chính: | , , |
|---|---|
| Định dạng: | Online |
| Ngôn ngữ: | Tiếng Anh |
| Được phát hành: |
MDPI - Multidisciplinary Digital Publishing Institute
2021
|
| Những chủ đề: | |
| Truy cập trực tuyến: | 44830 |
| Các nhãn: |
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| _version_ | 1869524576279461888 |
|---|---|
| author | Werner, Frank Sotskov, Yuri Burtseva, Larysa |
| author_browse | Burtseva, Larysa Sotskov, Yuri Werner, Frank |
| author_facet | Werner, Frank Sotskov, Yuri Burtseva, Larysa |
| author_sort | Werner, Frank |
| collection | Directory of Open Access Books |
| description | 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. |
| format | Online |
| id | doab-20.500.12854ir-47162 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2021 |
| publishDateRange | 2021 |
| publishDateSort | 2021 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-471622024-04-11T15:10:26Z Exact and Heuristic Scheduling Algorithms Werner, Frank Sotskov, Yuri Burtseva, Larysa TA1-2040 T1-995 repairing scheme makespan complexity uniform parallel machine problems flow shop uniform parallel machines total tardiness permutations uncertainty shop floor performance heuristic algorithm s-precedence constraints heuristics time windows auto-carrier transportation problem (ACTP) blocking computational experiment scheduling manufacturing optimal algorithm precedence constraints flowshop flow-shop flow shop problem simulated annealing traveling salesman problem resource leveling makespan criterion project scheduling uncertain duration time complexity heuristic quadratic programming feasible loading exact algorithms resource leveling problem job shop problem unavailability constraints job shop job-shop job shop scheduling thema EDItEUR::T Technology, Engineering, Agriculture, Industrial processes::TB Technology: general issues::TBX History of engineering and technology 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. 2021-02-11T13:13:34Z 2021-02-11T13:13:34Z 2020-04-07 23:07:09 2020 book 44830 9783039284696 9783039284689 https://directory.doabooks.org/handle/20.500.12854/47162 eng application/octet-stream Attribution-NonCommercial-NoDerivatives 4.0 International https://mdpi.com/books/pdfview/book/2107 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-03928-469-6 10.3390/books978-3-03928-469-6 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783039284696 9783039284689 200 open access |
| spellingShingle | TA1-2040 T1-995 repairing scheme makespan complexity uniform parallel machine problems flow shop uniform parallel machines total tardiness permutations uncertainty shop floor performance heuristic algorithm s-precedence constraints heuristics time windows auto-carrier transportation problem (ACTP) blocking computational experiment scheduling manufacturing optimal algorithm precedence constraints flowshop flow-shop flow shop problem simulated annealing traveling salesman problem resource leveling makespan criterion project scheduling uncertain duration time complexity heuristic quadratic programming feasible loading exact algorithms resource leveling problem job shop problem unavailability constraints job shop job-shop job shop scheduling thema EDItEUR::T Technology, Engineering, Agriculture, Industrial processes::TB Technology: general issues::TBX History of engineering and technology Werner, Frank Sotskov, Yuri Burtseva, Larysa Exact and Heuristic Scheduling Algorithms |
| title | Exact and Heuristic Scheduling Algorithms |
| title_full | Exact and Heuristic Scheduling Algorithms |
| title_fullStr | Exact and Heuristic Scheduling Algorithms |
| title_full_unstemmed | Exact and Heuristic Scheduling Algorithms |
| title_short | Exact and Heuristic Scheduling Algorithms |
| title_sort | exact and heuristic scheduling algorithms |
| topic | TA1-2040 T1-995 repairing scheme makespan complexity uniform parallel machine problems flow shop uniform parallel machines total tardiness permutations uncertainty shop floor performance heuristic algorithm s-precedence constraints heuristics time windows auto-carrier transportation problem (ACTP) blocking computational experiment scheduling manufacturing optimal algorithm precedence constraints flowshop flow-shop flow shop problem simulated annealing traveling salesman problem resource leveling makespan criterion project scheduling uncertain duration time complexity heuristic quadratic programming feasible loading exact algorithms resource leveling problem job shop problem unavailability constraints job shop job-shop job shop scheduling thema EDItEUR::T Technology, Engineering, Agriculture, Industrial processes::TB Technology: general issues::TBX History of engineering and technology |
| topic_facet | TA1-2040 T1-995 repairing scheme makespan complexity uniform parallel machine problems flow shop uniform parallel machines total tardiness permutations uncertainty shop floor performance heuristic algorithm s-precedence constraints heuristics time windows auto-carrier transportation problem (ACTP) blocking computational experiment scheduling manufacturing optimal algorithm precedence constraints flowshop flow-shop flow shop problem simulated annealing traveling salesman problem resource leveling makespan criterion project scheduling uncertain duration time complexity heuristic quadratic programming feasible loading exact algorithms resource leveling problem job shop problem unavailability constraints job shop job-shop job shop scheduling thema EDItEUR::T Technology, Engineering, Agriculture, Industrial processes::TB Technology: general issues::TBX History of engineering and technology |
| url | 44830 |
| work_keys_str_mv | AT wernerfrank exactandheuristicschedulingalgorithms AT sotskovyuri exactandheuristicschedulingalgorithms AT burtsevalarysa exactandheuristicschedulingalgorithms |