Pregled bibliografske jedinice broj: 166905
SGP Heuristics for One Machine Scheduling Problem
SGP Heuristics for One Machine Scheduling Problem // Proceedings of 7th International Symposium on Operations Research in Slovenia SOR 2003 / Zadnik Stirn, L. ; Bastič, M. ; Drobne, S. (ur.).
Ljubljana: Slovensko društvo informatika, 2003. str. 247-253 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 166905 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
SGP Heuristics for One Machine Scheduling Problem
Autori
Šorić, Kristina ; Vojvodić Rosenzweig, Višnja ; Drmač, Zlatko
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of 7th International Symposium on Operations Research in Slovenia SOR 2003
/ Zadnik Stirn, L. ; Bastič, M. ; Drobne, S. - Ljubljana : Slovensko društvo informatika, 2003, 247-253
Skup
7th International Symposium on Operations Research in Slovenia SOR 2003
Mjesto i datum
Podčetrtek, Slovenija, 24.09.2003. - 26.09.2003
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
single machine scheduling problem; sequence dependent setup; grouping problem; heuristics
Sažetak
Each of N jobs is to be processed on a single machine. Only one job can be processed at any given time. Each switch from one job to another requires sequence dependent setup time. The objective is to find a processing order which minimizes the makespan. Let call this problem the OMSC problem. OMSC problem is defined as a grouping problem. A heuristics called SGP Heuristics and based on spectral graph partitioning is presented with some computational results.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
