Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

A Cuting Plane Algorithm for Single Machine Scheduling Problem (CROSBI ID 471961)

Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija

Šorić, Kristina A Cuting Plane Algorithm for Single Machine Scheduling Problem // Sixth International Workshop on Project Management and Scheduling / Barbarosoglu, G. ; Karabati, S. ; Ozdamar, L. et al. (ur.). Istanbul: Bogazici University, 1998. str. 293-296-x

Podaci o odgovornosti

Šorić, Kristina

engleski

A Cuting Plane Algorithm for Single Machine Scheduling Problem

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.

single machine scheduling problem; cutting plane/branch and bound algorithm

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

293-296-x.

1998.

objavljeno

Podaci o matičnoj publikaciji

Sixth International Workshop on Project Management and Scheduling

Barbarosoglu, G. ; Karabati, S. ; Ozdamar, L. ; Ulsoy, G.

Istanbul: Bogazici University

Podaci o skupu

Sixth International Workshop on Project Management and Scheduling

predavanje

07.07.1998-09.07.1998

Istanbul, Turska

Povezanost rada

Ekonomija