Minimizing makespan in re-entrant permutation flow-shops

Pan Jc-H () and Chen J-S
Additional contact information
Pan Jc-H: National Taiwan University of Science and Technology
Chen J-S: Far East College

Journal of the Operational Research Society, 2003, vol. 54, issue 6, 642-653

Abstract: Abstract A re-entrant flow-shop (RFS) describes situations in which every job must be processed on machines in the order of M1, M2, …, M m , M1, M2, …,M m , …, and M1, M2, …,M m . In this case, every job can be decomposed into L levels and each level starts on M1, and finishes on M m . In a RFS case, if the job ordering is the same on any machine at each level, then it is said that no passing is allowed since any job is not allowed to pass any previous job. The RFS scheduling problem where no passing is allowed is called the re-entrant permutation flow-shop (RPFS) problem. This paper proposes three extended mixed BIP formulations and six extended effective heuristics for solving RPFS scheduling problems to minimize makespan.

Keywords: scheduling; re-entrant permutation flow-shops; integer programming (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601556 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:54:y:2003:i:6:d:10.1057_palgrave.jors.2601556

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

DOI: 10.1057/palgrave.jors.2601556

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