Kuwait-University-Journal-of-Law-header
Search
Kuwait Journal of Science

Previous Issues

Advance Search
Year : From To Vol
Issue Discipline:
Author

Volume :33 Issue : 2 2006      Add To Cart                                                                    Download

Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times

Auther : ALI ALLAHVERDI

Department of Industrial and Management Systems Engineering, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat, Kuwait, Fax: (+965)481-6137 allahverdi@kuc01.kuniv.edu.kw

 

 ABSTRACT

 

This study addresses a two-machine flowshop scheduling problem to minimize maximum lateness where setup times are treated as separate and sequence-independent. Both processing and setup times on both machines are relaxed to be unknown variables. The only known information is that lower and upper bounds are known for both processing and setup times of each job. For such a scheduling environment, there may not exist a unique schedule that remains optimal for any realization of setup and processing times. Moreover, for such a scheduling environment, the exact setup and processing times will not be known until all jobs are processed. Therefore, the objective for such a scheduling problem is to reduce the size of the solution set, which contains at least one optimal solution for any combination of feasible realizations of processing and setup times. In this paper, a local and global dominance relation are established in order to reduce the size of the solution set. Illustrative numerical examples are also given.

 

Keywords:  Bounded times; dominance relations; flowshop; maximum lateness; scheduling.

 

 

 

Kuwait Journal of Science
Journal of Law

You are Visitor No.

55635

Journal of Law
Journal of Law
Tell your friendsJournal of Law
Journal of Law

Last Updated

Jun 19, 2012

Journal of Law
Journal of Law
Journal of Law

Please enter your email Here to receive our news

Journal of Law