SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES

We consider a non-preemptive single machine scheduling problem with forbidden intervals. Associated with each job is a given processing time and a delivery time to its customer, when the processing of the job is complete. The objective is to minimize the time taken for all the jobs to be delivered t...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Asia-Pacific journal of operational research Ročník 25; číslo 3; s. 317 - 325
Hlavní autori:	YUAN, JINJIANG, SHI, LEI, OU, JINWEN
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Singapore World Scientific Publishing Co, & Operational Research Society of Singapore 01.06.2008 World Scientific Publishing Co. Pte., Ltd
Predmet:	Approximation Deliveries Job shops Machinery Operations research Scheduling algorithms Studies polynomial time approximation algorithms performance ratio PTAS Forbidden intervals delivery times
ISSN:	0217-5959, 1793-7019, 0217-5959
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!