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!
Popis
Shrnutí: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 to the customers. The problem is strongly NP-hard in general. In this study, we show that the case with a fixed number of forbidden intervals can be solved by a pseudo-polynomial time algorithm, while no polynomial time approximation algorithm with a fixed performance ratio exists for the case with two forbidden intervals. We also develop a polynomial time approximation scheme (PTAS) for the case with a single forbidden interval.
Bibliografia:Project partially supported by NSFC (10671183).
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0217-5959
1793-7019
0217-5959
DOI:10.1142/S0217595908001778