In this paper, we study a scheduling problem of jobs from two different queues on several parallel servers. Jobs have exponentially distributed processing times, and incur costs per unit of time, until they leave the system, and there are no arrivals to the system at any time. The objective is...

In this paper, we study a scheduling problem of jobs from two different queues on several parallel servers. Jobs have exponentially distributed processing times, and incur costs per unit of time, until they leave the system, and there are no arrivals to the system at any time. The objective is...

This paper considers Arkin and Roundy's single machine weighted tardiness scheduling model with tardiness penalties proportional to the processing times. It presents a two-stage decomposition mechanism that proves to be powerful in solving the problem completely or reducing it to a much smaller...

W artykule omowiono problem planowania i harmonogramowania tras dla samochodow w warunkach istnienia rozmytych okien czasowych klientow i rozmytego celu. Sformulowano model mieszany programowania calkowitoliczbowego bazujacy na kryterium max-min i wykorzystujacy zasade uogolniania Zadeha....