Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30895
Title: Machine scheduling with job class setup and delivery considerations
Authors: Cheng, TCE 
Wang, X
Keywords: Algorithms
Job class setup
Machine scheduling
Transportation
Issue Date: 2010
Publisher: Pergamon Press
Source: Computers and operations research, 2010, v. 37, no. 6, p. 1123-1128 How to cite?
Journal: Computers and operations research 
Abstract: We study machine scheduling problems in which the jobs belong to different job classes and they need to be delivered to customers after processing. A setup time is required for a job if it is the first job to be processed on a machine or its processing on a machine follows a job that belongs to another class. Processed jobs are delivered in batches to their respective customers. The batch size is limited by the capacity of the delivery vehicles and each shipment incurs a transport cost and takes a fixed amount of time. The objective is to minimize the weighted sum of the last arrival time of jobs to customers and the delivery (transportation) cost. For the problem of processing jobs on a single machine and delivering them to multiple customers, we develop a dynamic programming algorithm to solve the problem optimally. For the problem of processing jobs on parallel machines and delivering them to a single customer, we propose a heuristic and analyze its performance bound.
URI: http://hdl.handle.net/10397/30895
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2009.10.001
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Aug 10, 2017

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
0
Citations as of Aug 13, 2017

Page view(s)

43
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.