Akademik Veri Yönetim Sistemi
International Journal of Agile Manufacturing, cilt.8, sa.2, ss.145-153, 2005 (Scopus)
The two-machine scheduling problem to minimize makespan is addressed in cases in which set-up times are considered as separate from processing times and are sequenced independently. Moreover, processing times and set-up times are relaxed, so as to be unknown variables before scheduling, rather than deterministic, as is commonly assumed in the scheduling literature. The only known information is that lower and upper bounds are known for both processing and set-up times of each job. For such flowshops, there may not exist a unique schedule that remains optimal with respect to any realizations of set-up and processing times. Therefore, an objective in such a flowshop is to reduce cardinality of the solution set that might consist of many schedules. Dominance relations are developed, which help to reduce the cardinality of the solution set. An illustrative numerical example is given. © 2005 IJAM.