Showing 1 - 10 of 176,162
Persistent link: https://www.econbiz.de/10012417552
Persistent link: https://www.econbiz.de/10012417627
Persistent link: https://www.econbiz.de/10014371762
We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...
Persistent link: https://www.econbiz.de/10013152472
scheduling is one of the most important problems and is being actively researched. Extant studies assume that processing times …-learning model. Although there are studies that use machine learning for scheduling optimization itself, it should be noted that the … parallel machine scheduling using estimated processing time by our method resulted in an average reduction of approximately 30 …
Persistent link: https://www.econbiz.de/10012596666
Scheduling problems occur in a broad range of real-world application fields and have attracted a huge set of research … articles. However, there is only little research on exact algorithms for scheduling problems, many of which are NP-hard in the …
Persistent link: https://www.econbiz.de/10014359595
Persistent link: https://www.econbiz.de/10014456662
railway scheduling problem is to determine, ahead of time (timetabling), a plan describing the timing of the operations in a … scheduling problem is increasing, for large-scale networks and multiple interconnected problems, this is of great value for … network operators. When planning or adjusting railway operations becomes increasingly complex, modern scheduling algorithms …
Persistent link: https://www.econbiz.de/10014518070
Persistent link: https://www.econbiz.de/10011671971
Persistent link: https://www.econbiz.de/10012498130