Two-Machine No-Wait Flow Shop Scheduling Problem with Precedence Constraints

Saied Samie () and Behrooz Karimi ()
Additional contact information
Saied Samie: Amirkabir University of Technology
Behrooz Karimi: Amirkabir University of Technology

A chapter in Operations Research Proceedings 2006, 2007, pp 191-196 from Springer

Abstract: Abstract In this paper, we consider two-machine permutation flow shop scheduling problem to minimize the makespan in which some of the jobs have to be processed with no-wait in process. We also consider precedence constraints which impose some jobs to be processed before or after some others. We propose a constructive algorithm to find a feasible solution. We also develop a Tabu Search algorithm to solve this problem. Our computational analysis indicates its good performance.

Keywords: Travel Salesman Problem; Travel Salesman Problem; Precedence Constraint; Feasible Schedule; Tabu List (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:oprchp:978-3-540-69995-8_32

Ordering information: This item can be ordered from
http://www.springer.com/9783540699958

DOI: 10.1007/978-3-540-69995-8_32

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().