Scheduling the two-machine flowshop to hedge against processing time uncertainty

Kuo-Ching Ying
Additional contact information
Kuo-Ching Ying: National Taipei University of Technology, Taipei, Taiwan

Journal of the Operational Research Society, 2015, vol. 66, issue 9, 1413-1425

Abstract: This paper addresses the two-machine flowshop scheduling problem with uncertain job processing times. It is assumed that in the realization of a schedule, job processing times may take any values from their corresponding intervals given before scheduling. The objective is to determine a robust schedule with the minimum makespan of the restricted worst-case scenario among all possible scenarios to hedge against processing time uncertainty for a given number of jobs. We formulate the problem of interest as a robust counterpart optimization model, and apply a simulated annealing (SA) algorithm and an iterated greedy (IG) algorithm to solve it. The experimental results show that both algorithms are effective in determining robust schedules for small-size problems, while the IG algorithm is more effective than the SA algorithm for large-size problems, albeit at the expense of more computational time.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v66/n9/pdf/jors2014100a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v66/n9/full/jors2014100a.html Link to full text HTML (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:pal:jorsoc:v:66:y:2015:i:9:p:1413-1425

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

Access Statistics for this article

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

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().