TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION

Qiang Gao () and Xiwen Lu ()
Additional contact information
Qiang Gao: Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China
Xiwen Lu: Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China

Asia-Pacific Journal of Operational Research (APJOR), 2014, vol. 31, issue 01, 1-13

Abstract: A two-machine flow shop scheduling problem with rejection is considered in this paper. The objective is to minimize the sum of makespan of accepted operations and total penalty of rejected operations. Each job has two operations that could be rejected, respectively. Operations on the first machine have penalties α1 times of their processing times and operations on the second machine have penalties α2 times of their processing times. A $\frac{4}{3}$-approximation algorithm is presented for the case where min{α1, α2}

Keywords: Flow shop scheduling; rejection; operation's penalty; FPTAS (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S021759591450002X
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:31:y:2014:i:01:n:s021759591450002x

Ordering information: This journal article can be ordered from

DOI: 10.1142/S021759591450002X

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().