Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval

This paper addresses the problem of scheduling n nonresumable and simultaneously available jobs on a single machine, where the machine has a fixed unavailability interval, and the jobs are delivered in batches to the customers. There is no capacity limit on each delivery batch, and the cost per batc...

Full description

Bibliographic Details

Published in:	Information sciences Vol. 274; pp. 310 - 322
Main Authors:	Yin, Yunqiang, Ye, Deshi, Zhang, Guochuan
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.08.2014
Subjects:	Batch delivery Fully polynomial time approximation scheme Scheduling Fully polynomial time approximation scheme Batch delivery Scheduling
ISSN:	0020-0255
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!