Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm
نویسندگان
چکیده
منابع مشابه
Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm
This paper considers a real-world industrial problem in order to minimize the (weighted) number of tardy jobs. This problem occurs in a company where due dates are associated with parts, and penalties incur when the parts are completed after the due dates, whatever the magnitude of the tardiness. Therefore, the objective function can be modelled as minimization of the (weighted) number of tardy...
متن کاملMinimizing the weighted number of tardy jobs in a hybrid flow shop with Genetic Algorithm
This paper considers a real-world industrial problem in order to minimize the (weighted) number of tardy jobs. This problem occurs in a company where due dates are associated with parts, and penalties incur when the parts are completed after the due dates, whatever the magnitude of the tardiness. Therefore, the objective function can be modelled as minimization of the (weighted) number of tardy...
متن کاملA branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release dates
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملA rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop
This paper addresses the job shop scheduling problem with minimizing the number of tardy jobs as the objective. This problem is usually treated as a job sequencing problem, and the permutation-based representation of solutions was commonly used in the existing search-based approaches. In this paper, the flaw of the permutation-based representation is discussed, and a rule-centric concept is pro...
متن کاملMinimizing the Expected Number of Tardy Jobs in Dynamic Flow Shop with Stochastic Due Dates
The problem of minimizing the expected number of tardy jobs in a dynamic m machine flow shop i.e., Fm�rj�E�∑Uj� is studied in this research. It is assumed that the jobs with deterministic processing times and stochastic due dates arrive dynamically and randomly to the flow shop cell. The due date of each job is assumed to be normally distributed with known mean and variance. A dynamic method is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Integrated Manufacturing
سال: 2009
ISSN: 0951-192X,1362-3052
DOI: 10.1080/09511920902810938