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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Asia-Pacific journal of operational research Jg. 25; H. 3; S. 317 - 325
Hauptverfasser:	YUAN, JINJIANG, SHI, LEI, OU, JINWEN
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Singapore World Scientific Publishing Co, & Operational Research Society of Singapore 01.06.2008 World Scientific Publishing Co. Pte., Ltd
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!