Pregled bibliografske jedinice broj: 34890
A Cutting Plane Algorithm for Single Machine Scheduling Problem
A Cutting Plane Algorithm for Single Machine Scheduling Problem // Sixth International Workshop on Project Management and Scheduling / Barbarosoglu, G. ; Karabati, S. ; Ozdamar, L. ; Ulsoy, G. (ur.).
Istanbul: Bogazici University, 1998. str. 293-296 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 34890 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
A Cutting Plane Algorithm for Single Machine Scheduling Problem
(A Cuting Plane Algorithm for Single Machine Scheduling Problem)
Autori
Šorić, Kristina
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Sixth International Workshop on Project Management and Scheduling
/ Barbarosoglu, G. ; Karabati, S. ; Ozdamar, L. ; Ulsoy, G. - Istanbul : Bogazici University, 1998, 293-296
Skup
Sixth International Workshop on Project Management and Scheduling
Mjesto i datum
Istanbul, Turska, 07.07.1998. - 09.07.1998
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
single machine scheduling problem; cutting plane/branch and bound algorithm
Sažetak
Each of N part types (production families or items) is to be processed on a single machine. The part types arrive into the buffer in front of the machine at every unit time at specified rates. Only one part type can be processed at any given time. Each switch from one type to another requires setup time. The objective is to find a processing order which minimizes thw weighted sum of start times. In this paper a cutting plane/branch and bound algorithm is presented with some computational results.
Izvorni jezik
Engleski
Znanstvena područja
Ekonomija
POVEZANOST RADA
