Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/11254
Title: An exact algorithm for batching and scheduling two part types in a mixed shop: A technical note
Authors: Cheng, TCE 
Kovalyov, MY
Keywords: Batching
Scheduling
Issue Date: 1998
Publisher: Elsevier
Source: International journal of production economics, 1998, v. 55, no. 1, p. 53-56 How to cite?
Journal: International journal of production economics 
Abstract: We consider the problem of scheduling jobs consisting of two part types in a shop made up of three machines. The processing of each job comprises two stages. The first stage is undertaken on the machine common to all jobs and the second stage is undertaken on the machine specific to a particular part type. Set-up times are necessary at the first stage to switch processing from a job of one part type to a job of the other part type. Jobs of the same part type processed contiguously at the first stage form a batch. The objective is to find a batch schedule minimizing the makespan. An integer programming formulation and a heuristic algorithm for this problem have been reported in the literature. We present a dynamic programming algorithm which solves the problem optimally in a time polynomial in the number of jobs.
URI: http://hdl.handle.net/10397/11254
ISSN: 0925-5273
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 Oct 16, 2017

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
0
Citations as of Oct 13, 2017

Page view(s)

68
Last Week
0
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check



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