A new algorithm for minimizing makespan, C max, in blocking flow-shop problem through slowing down the operations

I N Kamal Abadi ()
Additional contact information
I N Kamal Abadi: University of Kurdistan

Journal of the Operational Research Society, 2007, vol. 58, issue 1, 134-140

Abstract: Abstract In this paper, a new algorithm with complexity O(nm 2) is presented, which finds the optimal makespan, C max, for a blocking flow-shop problem by slowing down the operations of a no-wait flow-shop problem, F m ∣no-wait∣C max, for a given sequence where restriction on the slowing down is committed. However, the problem with performance measure makespan, C max, in a non-cyclic environment, is a special case of cyclic problem with cycle time, C t , as its performance measure. This new algorithm is much faster than the previously developed algorithms for cyclical scheduling problems.

Keywords: production scheduling; blocking flow-shop; heuristics (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2602099 Abstract (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:58:y:2007:i:1:d:10.1057_palgrave.jors.2602099

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

DOI: 10.1057/palgrave.jors.2602099

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 ().