Two-Stage Flowshop Scheduling Problems With Identical And Batch Processors
This paper considers minimizing total completion time in a two-stage flowshop scheduling problem with m identical parallel machines at Stage 1 and a batch processor at Stage 2. We prove that the problem when all jobs have same processing time at Stage 2 is NP – hard and gave a two-approximation algorithm in O(n3) time. In the case that all jobs have arbitrary processing time at Stage 1 and at Stage 2, we give an approximation algorithm after pointing out that in this case the problem is strongly NP – hard. Hundreds of instances of a numerical experiment show that the worst-case ratio of this approximation algorithm is nearing 2.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 27 (2010)
Issue (Month): 05 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/apjor/apjor.shtml |
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:27:y:2010:i:05:p:617-627. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.