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

Full description

Bibliographic Details

Published in:	Asia-Pacific journal of operational research Vol. 25; no. 3; pp. 317 - 325
Main Authors:	YUAN, JINJIANG, SHI, LEI, OU, JINWEN
Format:	Journal Article
Language:	English
Published:	Singapore World Scientific Publishing Co, & Operational Research Society of Singapore 01.06.2008 World Scientific Publishing Co. Pte., Ltd
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!