EconPapers    
Economics at your fingertips  
 

Improved algorithms for scheduling on proportionate flowshop with job-rejection

Baruch Mor and Dana Shapira

Journal of the Operational Research Society, 2019, vol. 70, issue 11, 1997-2003

Abstract: The rejection method is an option commonly used in manufacturing systems as a tool to overcome overloaded assembly lines. The operations manager is given the ability to refuse to produce, or alternately to outsource some of the products. A flowshop environment is a setting of machines in series such that each job should be processed on each of the machines. In a recent paper, Shabtay and Oron (2016), the two disciplines are combined, and the makespan criteria is studied, which is one of the fundamental measures in scheduling theory that reveals the utilization of the system. The problems considered are minimizing the makespan subject to a constraint on the maximal rejection cost, E, and minimizing the rejection cost given that the makespan cannot exceed a given upper bound, K. The computational complexity of the pseudo polynomial dynamic programming (DP) algorithms presented by Shabtay and Oron are O(n2E) and O(n2K), respectively, where n is the number of jobs. In this paper, we consider the same problems, and our contributions are enhanced DP algorithms, which run in O(nE) and O(nK) time, in correspondence, implying an improvement of a factor of n. Furthermore, we supply empirical results based on the experimental simulations. This study, therefore, has both theoretical significance and practical implications, as our numerical study proves that the introduced DP algorithms are capable of solving large-size instances.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2018.1506540 (text/html)
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:taf:tjorxx:v:70:y:2019:i:11:p:1997-2003

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2018.1506540

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().

 
Page updated 2025-03-20
Handle: RePEc:taf:tjorxx:v:70:y:2019:i:11:p:1997-2003