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

Podrobná bibliografie

Vydáno v:	Asia-Pacific journal of operational research Ročník 25; číslo 3; s. 317 - 325
Hlavní autoři:	YUAN, JINJIANG, SHI, LEI, OU, JINWEN
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Singapore World Scientific Publishing Co, & Operational Research Society of Singapore 01.06.2008 World Scientific Publishing Co. Pte., Ltd
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!