Results 121 to 130 of about 23,190 (193)

How the structure of precedence constraints may change the complexity class of scheduling problems

open access: yes, 2017
This survey aims at demonstrating that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems. Indeed many problems can be NP-hard when considering general precedence constraints, while they become ...
Bellenguez-Morineau, Odile, Prot, Damien
core   +1 more source

STUDI PERBANDINGAN PERFORMANCE ALGORITMA HEURISTIK POUR TERHADAP MIXED INTEGER PROGRAMMING DALAM MENYELESAIKAN PENJADWALAN FLOWSHOP

open access: yesJurnal Teknik Industri, 2004
This paper presents a study about new heuristic algorithm performance compared to Mixed Integer Programming (MIP) method in solving flowshop scheduling problem to reach minimum makespan.
Tessa Vanina Soetanto   +2 more
doaj  

Santa Claus meets Makespan and Matroids: Algorithms and Reductions

open access: yes
ISBN:978-1-61197-791 ...
Bamas, Étienne   +4 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy